Finding all door locations that make a room searchable

DOI10.1142/S0218195910003256zbMATH Open1190.90077OpenAlexW2118695911MaRDI QIDQ3562853FDOQ3562853

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

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

zbMATH Keywords

computational geometrypolygon searchpursuit and evasion

Mathematics Subject Classification ID

Search theory (90B40)

Cites Work

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

Cited In (3)

• A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable
• Title not available (Why is that?)
• An Optimal Algorithm for the 1-Searchability of Polygonal Rooms

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)