inria-00413159, version 1
An Algorithm for Constructing the Convex Hull of a Set of Spheres in Dimension d
Jean-Daniel Boissonnat
1André Cerezo a, 1Olivier Devillers
1Jacqueline Duquesne 1Mariette Yvinec
1, 2
Computational Geometry 6 (1996) 123-130
Résumé : We present an algorithm which computes the convex hull of a set of spheres in dimension d in time O(n^ceil(d/2)+n log n). It is worst case optimal in three dimensions and in even dimensions. The same method can also be used to compute the convex hull of a set of n homethetic objects of Ed. If the complexity of each object is constant, the time needed in the worst case is O(n^ceil(d/2)+n log n).
- a – Université de Nice
- 1 : PRISME (INRIA Sophia Antipolis)
- INRIA
- 2 : Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S)
- Université de Nice Sophia Antipolis (UNS) – CNRS : UMR7271
- Domaine : Informatique/Géométrie algorithmique
- inria-00413159, version 1
- http://hal.inria.fr/inria-00413159
- oai:hal.inria.fr:inria-00413159
- Contributeur : Olivier Devillers
- Soumis le : Jeudi 3 Septembre 2009, 14:15:56
- Dernière modification le : Mardi 20 Octobre 2009, 10:35:46






Documents associés
Exporter