Mapping Simple Polygons

DOI10.1145/2700223zbMath1398.68616OpenAlexW1970845672MaRDI QIDQ4962194

Matúš Mihalák, Jérémie Chalopin, Shantanu Das, Yann Disser, Peter Widmayer

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2700223

zbMATH Keywords

mappingrendezvouspolygonsrobotsvisibility graphsangles

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (3)

Meeting in a polygon by anonymous oblivious robots ⋮ The simple grid polygon exploration problem ⋮ A general lower bound for collaborative tree exploration

This page was built for publication: Mapping Simple Polygons