@inproceedings{fc5488751a1b42a08c0a2469d7338ce4,
title = "Spiral serpentine polygonization of a planar point set",
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 = "algorithm, computational geometry, point set, polygonization, serpentine, triangulation",
author = "Justin Iwerks and Mitchell, \{Joseph S.B.\}",
year = "2012",
doi = "10.1007/978-3-642-34191-5\_14",
language = "English",
isbn = "9783642341908",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "146--154",
booktitle = "Computational Geometry - XIV Spanish Meeting, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Revised Selected Papers",
note = "14th Spanish Meeting on Computational Geometry ; Conference date: 27-06-2011 Through 30-06-2011",
}