TY - GEN

T1 - Minkowski-type theorems and least-squares partitioning

AU - Aurenhammer, Franz

AU - Hoffmann, Friedrich

AU - Aronov, Boris

N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

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 -