Simple algorithms for searching a polygon with flashlights

Information Processing Letters

Volumn 81, Issue 5, 2002, Pages 265-270

  Lee, Jae Ha ^a   Park, Sang Min ^a   Chwa, Kyung Yong ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

Computational geometry; Graph algorithms; Path planning; Visibility

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MOTION PLANNING;

GRAPH ALGORITHMS; POLYGON SEARCH PROBLEMS;

COMPUTATIONAL GEOMETRY;

EID: 0037117173     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00235-6     Document Type: Article

References (10)

1. Searching for a mobile intruder in a corridor - The open edge variant of the polygon search problem
2. Sweeping simple polygons with a chain of guards
3. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygon
4. A visibility-based pursuit-evasion problem
5. The two guards problem
6. An algorithm for searching a polygonal region with a flashlight
7. Searching a polygonal room with one door by a 1-searcher
8. Visibility-based pursuit-evasion in a polygonal room with a door
9. On some link distance problems in a simple polygon
10. Searching for a mobile intruder in a polygonal region