CLEARING A POLYGON WITH TWO 1-SEARCHERS

DOI10.1142/S0218195909002836MaRDI QIDQ3628102zbMATH OpenOpenAlexFDO

Authors Borislav H. Simov, Giora Slutzki, Steven M. LaValle

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

motion planningnumerical examplespursuit-evasionroboticssensingvisibility

Mathematics Subject Classification ID

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

Recommendations

• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• Simple algorithms for searching a polygon with flashlights
• scientific article; zbMATH DE number 1754612
• Searching for a Mobile Intruder in a Polygonal Region
• Searching a Polygonal Region by Two Guards

Cites work

• A linear algorithm for computing the visibility polygon from a point
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Searching for a Mobile Intruder in a Polygonal Region
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• THE TWO GUARDS PROBLEM
• Triangulating a simple polygon in linear time
• Two-Guard Walkability of Simple Polygons

Cited in

(8)

• Clearing an orthogonal polygon to find the evaders
• The searchlight problem for road networks
• Optimum sweeps of simple polygons with two guards
• Characterizing and recognizing LR-visibility polygons
• A complete algorithm for searchlight scheduling
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• Searching a Polygonal Region by Two Guards
• Searching for mobile intruders in circular corridors by two 1-searchers

This page was built for publication: CLEARING A POLYGON WITH TWO 1-SEARCHERS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628102)