Searching a Circular Corridor with Two Flashlights

DOI10.1007/978-3-642-02017-9_37MaRDI QIDQ3630220zbMATH OpenOpenAlexFDO

Authors Bo Jiang, Xuehou Tan

Publication date 3 June 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_37

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Searching for mobile intruders in circular corridors by two 1-searchers
• scientific article; zbMATH DE number 1507309
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Simple algorithms for searching a polygon with flashlights
• Searching for a Mobile Intruder in a Polygonal Region

Cited in

(3)

• scientific article; zbMATH DE number 1507309 (Why is no real title available?)
• SEARCHING A ROOM BY TWO GUARDS
• Searching for mobile intruders in circular corridors by two 1-searchers

This page was built for publication: Searching a Circular Corridor with Two Flashlights

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