SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
From MaRDI portal
Publication:4682196
DOI10.1142/S0218195900000127zbMath1074.68642MaRDI QIDQ4682196
Jae-Ha Lee, Kyung-Yong Chwa, Sang-Min Park
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
SEARCHING A POLYGONAL REGION FROM THE BOUNDARY, On the domination search number, Simple algorithms for searching a polygon with flashlights
Cites Work
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
- The Searchlight Scheduling Problem
- Searching for a Mobile Intruder in a Polygonal Region
- THE TWO GUARDS PROBLEM
- Two-Guard Walkability of Simple Polygons
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
- AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM