---
res:
bibo_abstract:
- We propose a uniform and general framework for defining and dealing with Voronoi
diagrams. In this framework a Voronoi diagram is a partition of a domainD induced
by a finite number of real valued functions onD. Valuable insight can be gained
when one considers how these real valued functions partitionD ×R. With this view
it turns out that the standard Euclidean Voronoi diagram of point sets inR d along
with its order-k generalizations are intimately related to certain arrangements
of hyperplanes. This fact can be used to obtain new Voronoi diagram algorithms.
We also discuss how the formalism of arrangements can be used to solve certain
intersection and union problems.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Herbert Edelsbrunner
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
- foaf_Person:
foaf_givenName: Raimund
foaf_name: Seidel, Raimund
foaf_surname: Seidel
bibo_doi: 10.1007/BF02187681
bibo_issue: '1'
bibo_volume: 1
dct_date: 1986^xs_gYear
dct_publisher: Springer@
dct_title: Voronoi diagrams and arrangements@
...