Abstract
We propose a linear working space algorithm for reconstructing a simple polygon from the visibility angle information at vertices up to similarity. We also modify the algorithm such that its running time is sensitive to the size of visibility graph and also the diameter of a triangulation of the polygon. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Chun, J., De Gonzalo, R. G., & Tokuyama, T. (2013). Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 22–32). https://doi.org/10.1007/978-3-642-45030-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
