CLEARING A POLYGON WITH TWO 1-SEARCHERS

DOI10.1142/S0218195909002836zbMath1170.65014OpenAlexW2154329468MaRDI QIDQ3628102

S. M. LaValle, Borislav H. Simov, Giora Slutzki

Publication date: 19 May 2009

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

Full work available at URL: https://doi.org/10.1142/s0218195909002836

zbMATH Keywords

numerical examplesmotion planningroboticsvisibilitypursuit-evasionsensing

Mathematics Subject Classification ID

Kinematics of mechanisms and robots (70B15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Searching for mobile intruders in circular corridors by two 1-searchers ⋮ Optimum sweeps of simple polygons with two guards ⋮ Characterizing and recognizing LR-visibility polygons ⋮ The searchlight problem for road networks

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Triangulating a simple polygon in linear time
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• A linear algorithm for computing the visibility polygon from a point
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• 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
• Searching for mobile intruders in a polygonal region by a group of mobile searchers