FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE

DOI10.1142/S0218195910003256zbMath1190.90077OpenAlexW2118695911MaRDI QIDQ3562853

John Zhang, Tsunehiko Kameda

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)

Cites Work

• LR-visibility in polygons
• Visibility and intersection problems in plane geometry
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A unified and efficient solution to the room search problem
• Searching for a Mobile Intruder in a Polygonal Region
• THE TWO GUARDS PROBLEM
• Two-Guard Walkability of Simple Polygons
• 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
• Set Merging Algorithms
• Characterizing LR-visibility polygons and related problems

This page was built for publication: FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE