Skip to main content
Conference Proceedings

Spiral serpentine polygonization of a planar point set

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7579 LNCS 146-154
DOI: 10.1007/978-3-642-34191-5_14
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Iwerks, J., & Mitchell, J. S. B. (2012). Spiral serpentine polygonization of a planar point set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 146–154). https://doi.org/10.1007/978-3-642-34191-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free