SEARCHING A ROOM BY TWO GUARDS

DOI10.1142/S021819590200092XzbMath1152.68675MaRDI QIDQ4818565

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

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)

Related Items (2)

A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable ⋮ FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE

Cites Work

• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• 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
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS

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