Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
- 1 January 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 43, 436-447
- https://doi.org/10.1007/978-3-540-92182-0_40
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Computing the volume of the union of cubesPublished by Association for Computing Machinery (ACM) ,2007
- Semi-Online Maintenance of Geometric Optima and MeasuresSIAM Journal on Computing, 2003
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- The problem of calculating the volume of a polyhedron is enumerably hardRussian Mathematical Surveys, 1989
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- Computing the volume is difficultDiscrete & Computational Geometry, 1987
- Monte-Carlo algorithms for the planar multiterminal network reliability problemJournal of Complexity, 1985
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978