Abstract
We introduce a simple algorithm for constructing a spiral serpentine polygonization of a set S of n ≥ 3 points in the plane. Our algorithm simultaneously gives a triangulation of the constructed polygon at no extra cost, runs in O(n logn) time, and uses O(n) space.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abellanas, M., García, J., Hernández-Peñalver, G., Hurtado, F., Serra, O., Urrutia, J.: Onion Polygonizations. Information Processing Letters 57, 165–173 (1996)
Agarwal, P.K., Hurtado, F., Toussaint, G.T., Trias, J.: On Polyhedra Induced by Point Sets in Space. Discrete Applied Mathematics 156, 42–54 (2008)
Arkin, E., Fekete, S.P., Hurtado, F., Mitchell, J.S.B., Noy, M., Sacristán, V., Sethia, S.: On the Reflexivity of Point Sets. In: Discrete and Computational Geometry: The Goodman-Pollack Festschrift, Algorithms and Combinatorics, vol. 25, pp. 139–156 (2003)
Chazelle, B.: On the Convex Layers of a Planar Set. IEEE Transactions on Information Theory 31, 509–517 (1985)
Deneen, L., Shute, G.: Polygonizations of Point Sets in the Plane. Discrete and Computational Geometry 3, 77–87 (1988)
Fekete, S.P.: On Simple Polygonizations with Optimal Area. Discrete and Computational Geometry 23, 73–110 (2000)
Graham, R.L.: An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. Information Processing Letters 1, 132–133 (1972)
Grünbaum, B.: Hamiltonian Polygons and Polyhedra. Geombinatorics 3, 83–89 (1994)
Hershberger, J., Suri, S.: Applications of a Semi-Dynamic Convex Hull Algorithm. BIT Numerical Mathematics 32, 249–267 (1992)
Iwerks, J., Mitchell, J. S. B.: Spiral Serpentine Polygonization of a Planar Point Set. In: Proceedings of XIV Spanish Meeting on Computational Geometry, pp. 181–184 (2011)
Newborn, M., Moser, W.O.J.: Optimal Crossing-Free Hamiltonian Circuit Drawings of K n . Journal of Combinatorial Theory, Series B 29, 13–26 (1980)
Quintas, L.V., Supnick, F.: On Some Properties of Shortest Hamiltonian Circuits. American Mathematical Monthly 72, 977–980 (1965)
Shamos, M.I., Hoey, D.: Closest-Point Problems. In: Proceedings of the Sixteenth IEEE Symposium on Foundations of Computer Science, pp. 151–162 (1975)
Steinhaus, H.: One Hundred Problems in Elementary Mathematics. Dover Publications, Inc., New York (1964)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Iwerks, J., Mitchell, J.S.B. (2012). Spiral Serpentine Polygonization of a Planar Point Set. In: Márquez, A., Ramos, P., Urrutia, J. (eds) Computational Geometry. EGC 2011. Lecture Notes in Computer Science, vol 7579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34191-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-34191-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34190-8
Online ISBN: 978-3-642-34191-5
eBook Packages: Computer ScienceComputer Science (R0)