A unified and efficient solution to the room search problem

DOI10.1016/j.comgeo.2007.04.001zbMath1138.65023OpenAlexW1966634438MaRDI QIDQ2479474

Xue-Hou 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

zbMATH Keywords

algorithmsroboticsvisibilitycomputational geometrytwo-guard problemroom search problemsearch schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Searching for mobile intruders in circular corridors by two 1-searchers ⋮ Minimization of the maximum distance between the two guards patrolling a polygonal region ⋮ Characterizing and recognizing LR-visibility polygons ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE ⋮ An efficient algorithm for the three-guard problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LR-visibility in polygons
• Sweeping simple polygons with the minimum number of chain guards
• Visibility and intersection problems in plane geometry
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• SEARCHING A POLYGONAL REGION FROM THE BOUNDARY
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• 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
• Combinatorial Geometry and Graph Theory
• Algorithms and Computation
• Characterizing LR-visibility polygons and related problems
• Searching for mobile intruders in a polygonal region by a group of mobile searchers

This page was built for publication: A unified and efficient solution to the room search problem