On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d -dimensional spheres

On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres

Full Text:

Pdf

Buy this Article

Authors:	Jean-Daniel Boissonnat	INRIA Sophia-Antipolis, Sophia-Antipolis Cedex, France
	Menelaos I. Karavelas	INRIA Sophia-Antipolis, Sophia-Antipolis Cedex, France

Published in:

· Proceeding

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2003
table of contents ISBN:0-89871-538-5

	2003 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 23 · Citation Count: 14

Tags: algorithms applications combinatorial algorithms combinatorial geometry computational geometry convex hulls möbius diagrams power diagrams spheres theory voronoi diagrams