International audienceBalls 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 ...
Knowledge about polyhedra and volumeThis Demonstration shows how to compute the volume of cones, tri...
Accepted manuscript was chapter 2, pp.17-39, then was published as chapter 4, pp.61-83.International...
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) an...
Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a uni...
We present a new algorithm for computing the volume of a convex polytope in a box. More precisely, g...
Let C be a set of n axis-aligned cubes in R 3, and let U(C) denote the union of C. We present an alg...
International audienceChoosing balls which best approximate a 3D object is a non trivial problem. To...
AbstractWe consider the computation of the volume of the union of high-dimensional geometric objects...
Given a set of spherical balls, called atoms, in three-dimensional space, its mass properties such a...
Abstract. In this short paper, we compute the volume of n-dimensional balls in Rn. The computations ...
Given a sample of points from the boundary of an object IR3, we construct a representation of the ob...
We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case r...
We present UNION3, a fast algorithm for computing the volume, area, and other mass properties, of th...
Abstract: "We discuss the problem of computing the volume of a convex body K in R[superscript n]. We...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
Knowledge about polyhedra and volumeThis Demonstration shows how to compute the volume of cones, tri...
Accepted manuscript was chapter 2, pp.17-39, then was published as chapter 4, pp.61-83.International...
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) an...
Balls and spheres are amongst the simplest 3D modeling primitives, and computing the volume of a uni...
We present a new algorithm for computing the volume of a convex polytope in a box. More precisely, g...
Let C be a set of n axis-aligned cubes in R 3, and let U(C) denote the union of C. We present an alg...
International audienceChoosing balls which best approximate a 3D object is a non trivial problem. To...
AbstractWe consider the computation of the volume of the union of high-dimensional geometric objects...
Given a set of spherical balls, called atoms, in three-dimensional space, its mass properties such a...
Abstract. In this short paper, we compute the volume of n-dimensional balls in Rn. The computations ...
Given a sample of points from the boundary of an object IR3, we construct a representation of the ob...
We discuss the problem of computing the volume of a convex body K in IR n . We review worst-case r...
We present UNION3, a fast algorithm for computing the volume, area, and other mass properties, of th...
Abstract: "We discuss the problem of computing the volume of a convex body K in R[superscript n]. We...
We experimentally study the fundamental problem of computing the volume of a convex polytope given a...
Knowledge about polyhedra and volumeThis Demonstration shows how to compute the volume of cones, tri...
Accepted manuscript was chapter 2, pp.17-39, then was published as chapter 4, pp.61-83.International...
It is a well known fact that for every polynomial time algorithm which gives an upper bound V (K) an...