Skip to main navigation Skip to search Skip to main content

Spiral serpentine polygonization of a planar point set

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publicationComputational Geometry - XIV Spanish Meeting, EGC 2011, Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday, Revised Selected Papers
Pages146-154
Number of pages9
DOIs
StatePublished - 2012
Event14th Spanish Meeting on Computational Geometry - Alcala de Henares, Spain
Duration: Jun 27 2011Jun 30 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7579 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Spanish Meeting on Computational Geometry
Country/TerritorySpain
CityAlcala de Henares
Period06/27/1106/30/11

Keywords

  • algorithm
  • computational geometry
  • point set
  • polygonization
  • serpentine
  • triangulation

Fingerprint

Dive into the research topics of 'Spiral serpentine polygonization of a planar point set'. Together they form a unique fingerprint.

Cite this