scientific article; zbMATH DE number 1786527
From MaRDI portal
Publication:4547822
zbMATH Open0990.68158MaRDI QIDQ4547822FDOQ4547822
Authors: Xuehou Tan 
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980339
Title of this publication is not available (Why is that?)
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Cited In (8)
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547822)
