Minkowski-type theorems and least-squares clustering

Franz Aurenhammer, Friedrich Hoffmann, and Boris Aronov
Algorithmica 20(1):61–76, Jan 1998
Proc. 8th Symp. Computational Geometry, ACM, Jun 1992, pp. 350–357
Tech. report B 92-09, Freie Univ. Berlin, Inst. für Informatik, Apr 1992
http://www.inf.fu-berlin.de/inst/pubs/tr-b-92-09.abstract.html

Cites:

• Dynamic Euclidean minimum spanning trees and extrema of binary functions