Voronoi Diagrams from Distance Graphs

Franz Aurenhammer, Mario Kapl, Bert Jüttler

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

Abstract

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
Pages185-188
Publication statusPublished - 2013

Fingerprint

Distance Graph
Voronoi Diagram
Metric
Distance in Graphs
Generalized Polygon
Voronoi Cell
Approximate Algorithm
Rescaling
Spline
Least Squares
Anisotropy
Diagram
Scalar
Graph in graph theory

Cite this

Aurenhammer, F., Kapl, M., & Jüttler, B. (2013). Voronoi Diagrams from Distance Graphs. In Proceeding 20th European Workshop on Computational Geometry EUROCG 2013 (pp. 185-188). Braunschweig.

Voronoi Diagrams from Distance Graphs. / Aurenhammer, Franz; Kapl, Mario; Jüttler, Bert.

Proceeding 20th European Workshop on Computational Geometry EUROCG 2013. Braunschweig, 2013. p. 185-188.

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

Aurenhammer, F, Kapl, M & Jüttler, B 2013, Voronoi Diagrams from Distance Graphs. in Proceeding 20th European Workshop on Computational Geometry EUROCG 2013. Braunschweig, pp. 185-188.
Aurenhammer F, Kapl M, Jüttler B. Voronoi Diagrams from Distance Graphs. In Proceeding 20th European Workshop on Computational Geometry EUROCG 2013. Braunschweig. 2013. p. 185-188
Aurenhammer, Franz ; Kapl, Mario ; Jüttler, Bert. / Voronoi Diagrams from Distance Graphs. Proceeding 20th European Workshop on Computational Geometry EUROCG 2013. Braunschweig, 2013. pp. 185-188
@inproceedings{f64b35dd815d42a4a84292ac5ede744c,
title = "Voronoi Diagrams from Distance Graphs",
abstract = "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 obtainedby 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{\ss}-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.",
author = "Franz Aurenhammer and Mario Kapl and Bert J{\"u}ttler",
year = "2013",
language = "English",
pages = "185--188",
booktitle = "Proceeding 20th European Workshop on Computational Geometry EUROCG 2013",

}

TY - GEN

T1 - Voronoi Diagrams from Distance Graphs

AU - Aurenhammer, Franz

AU - Kapl, Mario

AU - Jüttler, Bert

PY - 2013

Y1 - 2013

N2 - 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 obtainedby 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.

AB - 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 obtainedby 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.

M3 - Conference contribution

SP - 185

EP - 188

BT - Proceeding 20th European Workshop on Computational Geometry EUROCG 2013

CY - Braunschweig

ER -