 
Summary: MinkowskiType Theorems and LeastSquares Clustering
Franz Aurenhammer
Institute for Theoretical Computer Science
Graz University of Technology
Graz, Austria
Friedrich Homann
Institut fur Informatik
Technische Universitat Munchen
Munchen, Germany
Boris Aronov
Computer and Information Science Department
Polytechnic University
New York, USA
Abstract
Dissecting Euclidean dspace with the power diagram of n weighted point sites partitions
a given mpoint set into clusters, one cluster for each region of the diagram. In this manner,
an assignment of points to sites is induced. We show the equivalence of such assignments to
constrained Euclidean leastsquares assignments. As a corollary, there always exists a power
diagram whose regions partition a given ddimensional mpoint set into clusters of prescribed
sizes, no matter where the sites are placed. Another consequence is that constrained least
