Reconstructing visibility graphs with simple robots

DOI10.1007/978-3-642-11476-2_8MaRDI QIDQ3408162zbMATH OpenOpenAlexFDO

Authors D. Bilò, Y. Disser, Matúš Mihalák, Subhash Suri, E. Vicari, Peter Widmayer

Publication date 24 February 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11476-2_8

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Recommendations

• Reconstructing visibility graphs with simple robots
• scientific article; zbMATH DE number 5999543
• Mapping Simple Polygons
• Mapping simple polygons: how robots benefit from looking back
• How simple robots benefit from looking back

Cites work

• scientific article; zbMATH DE number 1629980 (Why is no real title available?)
• Mapping in unknown graph-like worlds
• Planning Algorithms
• The polygon exploration problem
• Visibility Algorithms in the Plane

Cited in

(9)

• scientific article; zbMATH DE number 1161283 (Why is no real title available?)
• An improved algorithm for reconstructing a simple polygon from its visibility angles
• A polygon is determined by its angles
• Simple agents learn to find their way: an introduction on mapping polygons
• Reconstructing visibility graphs with simple robots
• Reconstructing point set order types from radial orderings
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
• Mapping simple polygons: how robots benefit from looking back
• How simple robots benefit from looking back

This page was built for publication: Reconstructing visibility graphs with simple robots

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