Simple algorithms for searching a polygon with flashlights

DOI10.1016/S0020-0190(01)00235-6zbMath1053.68107OpenAlexW2059654325MaRDI QIDQ1847385

Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00235-6

zbMATH Keywords

mobile guard

Mathematics Subject Classification ID

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

Related Items

An alternative proof for the equivalence of searcher and 2-searcher ⋮ A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING ⋮ A framework for pursuit evasion games in

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

This page was built for publication: Simple algorithms for searching a polygon with flashlights