Simple algorithms for searching a polygon with flashlights
From MaRDI portal
Publication:1847385
DOI10.1016/S0020-0190(01)00235-6zbMath1053.68107MaRDI QIDQ1847385
Jae-Ha Lee, Kyung-Yong Chwa, Sang-Min Park
Publication date: 24 June 2003
Published in: Information Processing Letters (Search for Journal in Brave)
68W05: Nonnumerical algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Cites Work
- Unnamed Item
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Searching for a Mobile Intruder in a Polygonal Region
- THE TWO GUARDS PROBLEM
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
- An algorithm for searching a polygonal region with a flashlight