SEARCHING A ROOM BY TWO GUARDS

DOI10.1142/S021819590200092XMaRDI QIDQ4818565zbMATH OpenFDO

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

Publication date 29 September 2004

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

zbMATH Keywords

motion planningvisibilityroomtwo guards

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Searching a Circular Corridor with Two Flashlights
• scientific article; zbMATH DE number 2080273
• Guarding galleries where no point sees a small area.
• Watched guards in art galleries
• scientific article; zbMATH DE number 2121683
• Patrolling a perimeter
• Prisoners and guards on rectangular boards
• Prisoners, rooms, and light switches

Cites work

• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
• 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
• THE TWO GUARDS PROBLEM

Cited in

(4)

• Finding all door locations that make a room searchable
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• 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

This page was built for publication: SEARCHING A ROOM BY TWO GUARDS

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