Voronoi Diagrams from Distance Graphs

Franz Aurenhammer, Mario Kapl, Bert Jüttler

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We present a new type of Voronoi diagram in R2 that respects the anisotropy exerted on the plane by a given distance graph. It is based on a metric obtained
by smoothly and injectively embedding of R2 into Rm, and a scalar-valued function for re-scaling the distances. A spline representation of the embedding surface is constructed with the Gauß-Newton algorithm, which approximates the given distance graph in the sense of least squares. The graph is required to satisfy the generalized polygon inequality. We explain a simple method to compute the Voronoi diagrams for such metrics, and give conditions under which Voronoi cells stay connected. Several examples of diagrams resulting from different metrics are presented.
Original languageEnglish
Title of host publicationProceeding 20th European Workshop on Computational Geometry EUROCG 2013
Place of PublicationBraunschweig
Publication statusPublished - 2013

Fingerprint Dive into the research topics of 'Voronoi Diagrams from Distance Graphs'. Together they form a unique fingerprint.

Cite this