Finding all door locations that make a room searchable

DOI10.1142/S0218195910003256MaRDI QIDQ3562853zbMATH OpenOpenAlexFDO

Authors Tsunehiko Kameda, John Zhang

Publication date 28 May 2010

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195910003256

zbMATH Keywords

computational geometrypolygon searchpursuit and evasion

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• scientific article; zbMATH DE number 2080273
• SEARCHING A ROOM BY TWO GUARDS
• scientific article; zbMATH DE number 1786527
• A unified and efficient solution to the room search problem

Cites work

• A unified and efficient solution to the room search problem
• AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
• AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
• Characterizing LR-visibility polygons and related problems
• LR-visibility in polygons
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• SEARCHING A ROOM BY TWO GUARDS
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Searching for a Mobile Intruder in a Polygonal Region
• Set Merging Algorithms
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons
• Visibility and intersection problems in plane geometry

Cited in

(3)

• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• scientific article; zbMATH DE number 1786527 (Why is no real title available?)

This page was built for publication: Finding all door locations that make a room searchable

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