Two-Guard Walkability of Simple Polygons

DOI10.1142/S0218195998000060zbMath0957.68119MaRDI QIDQ4513202

No author found.

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

walk

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (17)

Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Finding all weakly-visible chords of a polygon in linear time ⋮ On hamiltonian triangulations in simple polygons (Extended Abstract) ⋮ A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ Characterizing and recognizing LR-visibility polygons ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons ⋮ LR-visibility in polygons ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE ⋮ Characterizing LR-visibility polygons and related problems ⋮ SEARCHING A POLYGONAL REGION FROM THE BOUNDARY ⋮ SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER ⋮ ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS ⋮ An efficient algorithm for the three-guard problem ⋮ CLEARING A POLYGON WITH TWO 1-SEARCHERS ⋮ Partially Walking a Polygon ⋮ Partially walking a polygon

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• An optimal visibility graph algorithm for triangulated simple polygons
• Minimum Cuts for Circular-Arc Graphs

This page was built for publication: Two-Guard Walkability of Simple Polygons