An algorithm for constructing the convex hull of a set of spheres in dimension d

Computational Geometry: Theory and Applications

Volumn 6, Issue 2, 1996, Pages 123-130

  Boissonnat, Jean Daniel ^a   Cérézo, André ^b   Devillers, Olivier ^a   Duquesne, Jacqueline ^a   Yvinec, Mariette ^a,c  

^a INRIA   (France)

^b UNIVERSITÉ CÔTE D'AZUR   (France)

^c UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

Computational geometry; Convex hull; Spheres

Indexed keywords

EID: 0001430830     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00024-0     Document Type: Article

References (8)

1. J.-D. Boissonnat, A. Cérézo and J. Duquesne, An output-sensitive algorithm for constructing the convex hull of a set of spheres, in: IFIP Conference on Algorithms and Efficient Computation, September 1992.
2. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud and M. Yvinec, Applications of random sampling to on-line algorithms in computational geometry, Discrete Comput. Geom. 8 (1992) 51-71.
3. B. Chazelle, An optimal convex hull algorithm for point sets in any fixed dimension. Technical Report CS-TR-336-91, Dept. Comput. Sci., Princeton Univ., Princeton, NJ, 1991.
4. K.L. Clarkson and P.W. Shor, Applications of random sampling in computational geometry II, Discrete Comput. Geom. 4 (1989) 387-421.
5. P. McMullen, The maximal number of faces of a convex polytope, Mathematica 17 (1970) 179-184.
6. D. Rappaport, A convex hull algorithm for discs, and applications, Comput. Geom. Theory Appl. 1 (1992) 171-181.
7. J.T. Schwartz and M. Sharir, On the two-dimensional Davenport-Schinzel problem, J. Symbolic Comput. 10 (1990) 371-393.
8. R. Seidel, Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991) 423-434.