Efficient algorithms for searching a polygonal room with a door

DOI10.1007/3-540-47738-1_32MaRDI QIDQ4547822zbMATH OpenFDO

Authors Xuehou Tan

Publication date 21 August 2002

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/2098/20980339

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A unified and efficient solution to the room search problem
• 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
• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms

Cited in

(9)

• 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
• scientific article; zbMATH DE number 2080273 (Why is no real title available?)
• An efficient solution to the corridor search problem
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
• The two-guard problem on curvilinear polygons

This page was built for publication: Efficient algorithms for searching a polygonal room with a door

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