Computing the Volume of a Union of Balls: a Certified Algorithm - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2009

Computing the Volume of a Union of Balls: a Certified Algorithm

(1) , (2) , (1)
Frédéric Cazals
  • Function : Author
  • PersonId : 905122
Kanhere Harshad
  • Function : Author
  • PersonId : 862493


Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a union of balls is an 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 using the interval arithmetic. Experimental results are presented on hand-crafted models presenting various difficulties, as well as on the 58,898 models found in the 2009-07-10 release of the Protein Data Bank.
Fichier principal
Vignette du fichier
RR-7013.pdf (512.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00409374 , version 1 (03-09-2009)


  • HAL Id : inria-00409374 , version 1


Frédéric Cazals, Kanhere Harshad, Sebastien Loriot. Computing the Volume of a Union of Balls: a Certified Algorithm. [Research Report] RR-7013, INRIA. 2009, pp.25. ⟨inria-00409374⟩
387 View
1302 Download


Gmail Facebook Twitter LinkedIn More