SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER

DOI10.1142/S0218195900000127zbMATH Open1074.68642MaRDI QIDQ4682196FDOQ4682196

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

Publication date: 10 June 2005

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

Recommendations

• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
• scientific article; zbMATH DE number 1786527
• scientific article; zbMATH DE number 2080272
• scientific article; zbMATH DE number 2080273
• SEARCHING A ROOM BY TWO GUARDS

zbMATH Keywords

graph algorithmmotion planningpursuit-evasionVisibility

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• Searching for a Mobile Intruder in a Polygonal Region
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• THE TWO GUARDS PROBLEM
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Two-Guard Walkability of Simple Polygons
• The Searchlight Scheduling Problem

Cited In (13)

• Characterization of boundary 1-searchers for polygons
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• A unified and efficient solution to the room search problem
• On the domination search number
• Simple algorithms for searching a polygon with flashlights
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Searching for mobile intruders in circular corridors by two 1-searchers
• A characterization of link-2 LR-visibility polygons with applications
• Sweeping simple polygons with the minimum number of chain guards
• Title not available (Why is that?)
• Algorithms – ESA 2004
• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms

This page was built for publication: SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER

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