Characterization of rooms searchable by two guards

DOI10.1007/3-540-40996-3_44MaRDI QIDQ4472524zbMATH OpenFDO

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

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690515.htm

Mathematics Subject Classification ID

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

Recommendations

• Algorithms and Computation
• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
• Searching for mobile intruders in circular corridors by two 1-searchers
• Searching a Polygonal Region by Two Guards
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• A unified and efficient solution to the room search problem
• On finding another room-partitioning of the vertices
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Efficient algorithms for searching a polygonal room with a door
• The guarding problem -- complexity and approximation

Cited in

(6)

• A unified and efficient solution to the room search problem
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Finding all door locations that make a room searchable
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• SEARCHING A ROOM BY TWO GUARDS
• The two-guard problem on curvilinear polygons

This page was built for publication: Characterization of rooms searchable by two guards

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