Reconstructing Visibility Graphs with Simple Robots

DOI10.1007/978-3-642-11476-2_8zbMath1274.68618OpenAlexW2174871174MaRDI QIDQ3408162

Davide Bilò, Yann Disser, Matúš Mihalák, Subhash Suri, Elias 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)

Related Items

Mapping simple polygons: how robots benefit from looking back, An improved algorithm for reconstructing a simple polygon from its visibility angles, Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains, A polygon is determined by its angles

Cites Work

• Unnamed Item
• The Polygon Exploration Problem
• Mapping in unknown graph-like worlds
• Visibility Algorithms in the Plane
• Planning Algorithms