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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.: Range Searching. In: Goodman, J., O’Rourke, J. (eds.) Handbook of Discrete and Comput. Geom., ch. 36, pp. 809–838. Chapman&Hall (2004)
Asano, T., Ghosh, S.K., Shermer, T.: Visibility in the Plane. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, ch. 19, pp. 829–876. Elseiver (2000)
Biedl, T., Durocher, S., Skneyink, J.: Reconstructing Polygons from Scanner Data. Theoretical Computer Science 412, 4161–4272 (2011)
Chen, D.Z., Wang, H.: An Improved Algorithm for Reconstructing a Simple Polygon from Its Visibility Angles. CGTA 45, 254–257 (2012)
Disser, Y., Mihalak, M., Widmayer, P.: A Polygon is Determined by Its Angles. CGTA 44, 418–426 (2011)
ElGindy, H., Everett, H., Toussaint, G.: Slicing an Ear Using Prune-and-Search. Pattern Recognition Letters 14(9), 719–722 (1993)
Goodrich, M.T., Tamassia, R.: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations. J. Algorithms 23(1), 51–73 (1987)
Hershberger, J.: An Optimal Visibility Graph Algorithm for Triangulated Simple Polygons. Algorithmica 4, 141–155 (1989)
Salowe, J.S.: Parametric Searching. In: Goodman, J., O’Rourke, J. (eds.) Handbook of Discrete and Comput. Geom., ch. 43, pp. 969–982. Chapman&Hall (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chun, J., de Gonzalo, R.G., Tokuyama, T. (2013). Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information. In: Cai, L., Cheng, SW., Lam, TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45030-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-45030-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45029-7
Online ISBN: 978-3-642-45030-3
eBook Packages: Computer ScienceComputer Science (R0)