An O(n log n) algorithm for the voronoi diagram of a set of simple curve segments

Research output: Contribution to journalArticle

Abstract

Let X be a given set of n circular and straight line segments in the plane where two segments may interest only at their endpoints. We introduce a new technique that computes the Voronoi diagram of X in O(n log n) time. This result improves on several previous algorithms for special cases of the problem. The new algorithm is relatively simple, an important factor for the numerous practical applications of the Voronoi diagram.

Original languageEnglish (US)
Pages (from-to)365-393
Number of pages29
JournalDiscrete and Computational Geometry
Volume2
Issue number1
DOIs
StatePublished - Dec 1987

Fingerprint

Voronoi Diagram
Curve
Line segment
Straight Line

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this

An O(n log n) algorithm for the voronoi diagram of a set of simple curve segments. / Yap, Chee.

In: Discrete and Computational Geometry, Vol. 2, No. 1, 12.1987, p. 365-393.

Research output: Contribution to journalArticle

@article{7161622ff11a467096d87b21e23668c3,
title = "An O(n log n) algorithm for the voronoi diagram of a set of simple curve segments",
abstract = "Let X be a given set of n circular and straight line segments in the plane where two segments may interest only at their endpoints. We introduce a new technique that computes the Voronoi diagram of X in O(n log n) time. This result improves on several previous algorithms for special cases of the problem. The new algorithm is relatively simple, an important factor for the numerous practical applications of the Voronoi diagram.",
author = "Chee Yap",
year = "1987",
month = "12",
doi = "10.1007/BF02187890",
language = "English (US)",
volume = "2",
pages = "365--393",
journal = "Discrete and Computational Geometry",
issn = "0179-5376",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - An O(n log n) algorithm for the voronoi diagram of a set of simple curve segments

AU - Yap, Chee

PY - 1987/12

Y1 - 1987/12

N2 - Let X be a given set of n circular and straight line segments in the plane where two segments may interest only at their endpoints. We introduce a new technique that computes the Voronoi diagram of X in O(n log n) time. This result improves on several previous algorithms for special cases of the problem. The new algorithm is relatively simple, an important factor for the numerous practical applications of the Voronoi diagram.

AB - Let X be a given set of n circular and straight line segments in the plane where two segments may interest only at their endpoints. We introduce a new technique that computes the Voronoi diagram of X in O(n log n) time. This result improves on several previous algorithms for special cases of the problem. The new algorithm is relatively simple, an important factor for the numerous practical applications of the Voronoi diagram.

UR - http://www.scopus.com/inward/record.url?scp=0346755279&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346755279&partnerID=8YFLogxK

U2 - 10.1007/BF02187890

DO - 10.1007/BF02187890

M3 - Article

VL - 2

SP - 365

EP - 393

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

SN - 0179-5376

IS - 1

ER -