Skip to Main content Skip to Navigation
Journal articles

Computing the Volume of Union of Balls: a Certified Algorithm

Abstract : Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a union of balls is elementary problem. Although a number of strategies addressing this problem have been investigated in several communities, we are not aware of any robust algorithm, and present the first such algorithm. Our calculation relies on the decomposition of the volume of the union into convex regions, namely the restrictions of the balls to their regions in the power diagram. Theoretically, we establish a formula for the volume of a restriction, based on Gauss' divergence theorem. The proof being constructive, we develop the associated algorithm. On the implementation side, we carefully analyse the predicates and constructions involved in the volume calculation, and present a certified implementation relying on interval arithmetic. The result is certified in the sense that the exact volume belongs to the interval computed. Experimental results are presented on hand-crafted models illustrating various difficulties, as well as on the 58,898 models found in the tenth of July 2009 release of the Protein Data Bank.
Complete list of metadatas

https://hal.inria.fr/hal-00849809
Contributor : Frederic Cazals <>
Submitted on : Thursday, August 1, 2013 - 10:25:16 AM
Last modification on : Thursday, March 5, 2020 - 5:34:49 PM

Identifiers

Collections

Citation

Frédéric Cazals, Kanhere Harshad, Sébastien Loriot. Computing the Volume of Union of Balls: a Certified Algorithm. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2011, 38 (1), ⟨10.1145/2049662.2049665⟩. ⟨hal-00849809⟩

Share

Metrics

Record views

179