Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects

DOI10.1007/978-3-540-92182-0_40MaRDI QIDQ3596739zbMATH OpenOpenAlexFDO

Authors Karl Bringmann, Tobias Friedrich

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.0835

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Abstract: We consider the computation of the volume of the union of high-dimensional geometric objects. While showing that this problem is #P-hard already for very simple bodies (i.e., axis-parallel boxes), we give a fast FPRAS for all objects where one can: (1) test whether a given point lies inside the object, (2) sample a point uniformly, (3) calculate the volume of the object in polynomial time. All three oracles can be weak, that is, just approximate. This implies that Klee's measure problem and the hypervolume indicator can be approximated efficiently even though they are #P-hard and hence cannot be solved exactly in time polynomial in the number of dimensions unless P=NP. Our algorithm also allows to approximate efficiently the volume of the union of convex bodies given by weak membership oracles. For the analogous problem of the intersection of high-dimensional geometric objects we prove #P-hardness for boxes and show that there is no multiplicative polynomial-time $2^{d^{1-epsilon}}$-approximation for certain boxes unless NP=BPP, but give a simple additive polynomial-time $epsilon$-approximation.

Recommendations

• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Computing the volume is difficult
• An FPTAS for the volume of some \(\mathcal{V}\)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
• An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
• An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution

Cited in

(8)

• Fast hypervolume approximation scheme based on a segmentation strategy
• An analysis of the hypervolume Sharpe-ratio indicator
• Computing Klee's measure of grounded boxes
• scientific article; zbMATH DE number 3967917 (Why is no real title available?)
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• An improved algorithm for Klee's measure problem on fat boxes
• Multiobjective optimization by using cutting angle methods and hypervolume criterion
• Approximating the volume of unions and intersections of high-dimensional geometric objects

This page was built for publication: Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596739)