Skip to content

Voronoi diagrams—a survey of a fundamental geometric data structure

Franz Aurenhammer

ACM Computing Surveys · 1991 · 4,498 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Aurenhammer, F. (1991). Voronoi diagrams—a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3), 345–405. https://doi.org/10.1145/116873.116880

In text: (Aurenhammer, 1991)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. The paper puts particular emphasis on the unified exposition of its mathematical and algorithmic properties. Finally, the paper provides the first comprehensive bibliography on Voronoi diagrams and related structures.

  1. Combinatorial Optimization: Algorithms and Complexity.1984
  2. The quickhull algorithm for convex hulls1996
  3. Integer and Combinatorial Optimization1990
  4. The Nucleolus of a Characteristic Function Game1969

Metadata from OpenAlex (CC0). Citations are generated from the published record.