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

DOI10.1016/0925-7721(95)00024-0zbMath0849.68125OpenAlexW1967531239MaRDI QIDQ1917048

Jean-Daniel Boissonnat, Mariette Yvinec, Jacqueline Duquesne, Olivier Devillers, André Cerezo

Publication date: 4 November 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00024-0

zbMATH Keywords

spheresconvex hull

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Minimal surface convex hulls of spheres ⋮ OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS ⋮ Convex hulls of spheres and convex hulls of disjoint convex polytopes ⋮ On computing the convex hull of (piecewise) curved objects ⋮ Separable Distance Transformation and Its Applications ⋮ QuickhullDisk: a faster convex hull algorithm for disks

Cites Work

• Small-dimensional linear programming and convex hulls made easy
• A convex hull algorithm for discs, and applications
• Applications of random sampling to on-line algorithms in computational geometry
• An optimal convex hull algorithm in any fixed dimension
• Applications of random sampling in computational geometry. II
• On the two-dimensional Davenport-Schinzel problem
• The maximum numbers of faces of a convex polytope

This page was built for publication: An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)