Computing the volume of the union of spheres
From MaRDI portal
Publication:1104079
DOI10.1007/BF01901190zbMATH Open0646.68051MaRDI QIDQ1104079FDOQ1104079
Authors: David Avis, Binay Bhattacharya, Hideki Imai
Publication date: 1988
Published in: The Visual Computer (Search for Journal in Brave)
Recommendations
computational geometryexact algorithmpower diagramunion of spheresLaguerre-Voronoi diagramvolume computing
Analysis of algorithms and problem complexity (68Q25) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Cites Work
Cited In (14)
- Cubature rules with positive weights on union of disks
- Improved algorithms for discs and balls using power diagrams
- Computing the volume, counting integral points, and exponential sums
- Tchakaloff-like compression of QMC volume and surface integration on the union of balls
- Exact calculation of the overlap volume of spheres and mesh elements
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- Mathematical analysis and calculation of molecular surfaces
- Volume of the intersection of three spheres
- The union of balls and its dual shape
- Computing the volume of a union of balls: a certified algorithm
- Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
- A boundary-partition-based Voronoi diagram of \(d\)-dimensional balls: definition, properties, and applications
- A computer method for estimating volumes and surface areas of complex structures consisting of overlapping spheres
- Computing the volume is difficult
This page was built for publication: Computing the volume of the union of spheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104079)