Approximating the volume of unions and intersections of high-dimensional geometric objects
- 27 March 2010
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 43 (6-7) , 601-610
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- On the hardness of approximate reasoningArtificial Intelligence, 1996
- Random walks in a convex body and an improved volume algorithmRandom Structures & Algorithms, 1993
- 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
- The measure problem for rectangular ranges in d-spaceJournal of Algorithms, 1981
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?The American Mathematical Monthly, 1977
- A note on a method for generating points uniformly on n -dimensional spheresCommunications of the ACM, 1959