Minkowski-type theorems and least-squares partitioning

Franz Aurenhammer; Friedrich Hoffmann; Boris Aronov

doi:10.1145/142675.142747

Minkowski-type theorems and least-squares partitioning

Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.

Original language	English (US)
Title of host publication	Eighth Annual Symposium On Computational Geometry
Publisher	Publ by ACM
Pages	350-357
Number of pages	8
ISBN (Print)	0897915178, 9780897915175
DOIs	https://doi.org/10.1145/142675.142747
State	Published - 1992
Event	Eighth Annual Symposium On Computational Geometry - Berlin, Ger Duration: Jun 10 1992 → Jun 12 1992

Publication series

Name	Eighth Annual Symposium On Computational Geometry

Other

Other	Eighth Annual Symposium On Computational Geometry
City	Berlin, Ger
Period	6/10/92 → 6/12/92

ASJC Scopus subject areas

General Engineering

Access to Document

10.1145/142675.142747

Cite this

@inproceedings{1f41ea3b92c749d490d9480925d32141,

title = "Minkowski-type theorems and least-squares partitioning",

abstract = "Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.",

author = "Franz Aurenhammer and Friedrich Hoffmann and Boris Aronov",

year = "1992",

doi = "10.1145/142675.142747",

language = "English (US)",

isbn = "0897915178",

series = "Eighth Annual Symposium On Computational Geometry",

publisher = "Publ by ACM",

pages = "350--357",

booktitle = "Eighth Annual Symposium On Computational Geometry",

}

TY - GEN

T1 - Minkowski-type theorems and least-squares partitioning

AU - Aurenhammer, Franz

AU - Hoffmann, Friedrich

AU - Aronov, Boris

PY - 1992

Y1 - 1992

N2 - Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.

AB - Consider a set S of n points, called sites, in the Euclidean plane. S induces a partition of the plane into n polygonal regions. This partition is known as the Voronoi diagram of S. If we fix a set X of m points in the plane, this set is partitioned by the Voronoi diagram of S into subsets. Given S and X, we would like to to be able to change the assignment by varying the distance function that underlies th Voronoi diagram of S.

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

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

U2 - 10.1145/142675.142747

DO - 10.1145/142675.142747

M3 - Conference contribution

AN - SCOPUS:0026986468

SN - 0897915178

SN - 9780897915175

T3 - Eighth Annual Symposium On Computational Geometry

SP - 350

EP - 357

BT - Eighth Annual Symposium On Computational Geometry

PB - Publ by ACM

T2 - Eighth Annual Symposium On Computational Geometry

Y2 - 10 June 1992 through 12 June 1992

ER -

Minkowski-type theorems and least-squares partitioning

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this