A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable

DOI10.1007/978-3-540-79228-4_44zbMath1139.68416OpenAlexW1954277079MaRDI QIDQ3502674

John Zhang, Tsunehiko Kameda

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_44

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Nonnumerical algorithms (68W05) 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 ⋮ Hide-and-Seek: Algorithms for Polygon Walk Problems

Cites Work

• LR-visibility in polygons
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons
• SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• SEARCHING A ROOM BY TWO GUARDS
• 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
• Characterizing LR-visibility polygons and related problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable