Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2011.153
URN: urn:nbn:de:0030-drops-30077
URL: https://drops.dagstuhl.de/opus/volltexte/2011/3007/
Chalopin, Jeremie ; Das, Shantanu ; Disser, Yann ; Mihalak, Matus ; Widmayer, Peter
Telling convex from reflex allows to map a polygon
| pdf-format: |
|
Abstract
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along edges of the visibility graph of P. The visibility graph has a vertex for every vertex of P and an edge between two vertices if they see each other, i.e.~if the line segment connecting them lies inside $P$ entirely. While located at a vertex, the robot is capable of ordering the vertices it sees in counter-clockwise order as they appear on the boundary, and for every two such vertices, it can distinguish whether the angle between them is convex (<= pi) or reflex (> pi). Other than that, distant vertices are indistinguishable to the robot. We assume that an upper bound on the number of vertices is known and show that the robot is always capable of reconstructing the visibility graph of P. We also show that multiple identical, indistinguishable and deterministic such robots can always position themselves such that they mutually see each other, i.e. such that they form a clique in the visibility graph.
BibTeX - Entry
@InProceedings{chalopin_et_al:LIPIcs:2011:3007,
author = {Jeremie Chalopin and Shantanu Das and Yann Disser and Matus Mihalak and Peter Widmayer},
title = {{Telling convex from reflex allows to map a polygon}},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
pages = {153--164},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-25-5},
ISSN = {1868-8969},
year = {2011},
volume = {9},
editor = {Thomas Schwentick and Christoph D{\"u}rr},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3007},
URN = {urn:nbn:de:0030-drops-30077},
doi = {10.4230/LIPIcs.STACS.2011.153},
annote = {Keywords: polygon mapping, map construction, autonomous agent, simple robot, visibility graph reconstruction}
}
| Keywords: | polygon mapping, map construction, autonomous agent, simple robot, visibility graph reconstruction | |
| Seminar: | 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) | |
| Issue date: | 2011 | |
| Date of publication: | 11.03.2011 |
