A unified and efficient solution to the room search problem
DOI10.1016/J.COMGEO.2007.04.001zbMATH Open1138.65023OpenAlexW1966634438MaRDI QIDQ2479474FDOQ2479474
Authors: Xuehou Tan 
Publication date: 26 March 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.04.001
Recommendations
- scientific article; zbMATH DE number 1786527
- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
- Publication:4504035
- A graph search algorithm for indoor pursuit/evasion
- A unifying approach to heuristic search
- A near-tight approximation algorithm for the robot localization problem
- A unified approach to approximate proximity searching
- An efficient algorithm for the “stable roommates” problem
- Generalized floorplans from assigned room adjacencies
algorithmscomputational geometryvisibilityroboticstwo-guard problemroom search problemsearch schedule
Deterministic scheduling theory in operations research (90B35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Searching for a Mobile Intruder in a Polygonal Region
- Title not available (Why is that?)
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- Visibility and intersection problems in plane geometry
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
- Title not available (Why is that?)
- Searching for mobile intruders in a polygonal region by a group of mobile searchers
- Combinatorial Geometry and Graph Theory
- THE TWO GUARDS PROBLEM
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
- AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
- Characterizing LR-visibility polygons and related problems
- Sweeping simple polygons with the minimum number of chain guards
- LR-visibility in polygons
- Algorithms and Computation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- Finding all door locations that make a room searchable
- An efficient algorithm for the three-guard problem
- Characterizing and recognizing LR-visibility polygons
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
- Title not available (Why is that?)
- Searching for mobile intruders in circular corridors by two 1-searchers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
This page was built for publication: A unified and efficient solution to the room search problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479474)
