Author:
Borgwardt Steffen,Brieden Andreas,Gritzmann Peter
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,General Mathematics
Reference17 articles.
1. Aurenhammer, F. (1987) Power diagrams: properties, algorithms and applications. SIAM J. Computing 16, 78–96.
2. Aurenhammer, F., Hoffmann, F., Aronov, B. (1992) Minkowski-type theorems and least-squares partitioning. In: Proc. 8th Ann. ACM Symp. Comput. Geom., Berlin, 350–357.
3. Aurenhammer, F., Hoffmann, F., Aronov, B. (1998) Minkowski-type theorems and least-squares clustering. Algorithmica 20, 61–76.
4. Aurenhammer, F., Klein, R. (2000) Voronoi diagrams. In: Handbook of Computational Geometry, Sack, J., Urrutia, G., eds., Elsevier, 201–290.
5. Bárány, I. and Füredi, Z. (1986) Computing the volume is difficult, Proc. 18th Annual ACM Symposium on Theory of Computing, 442–447.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献