Jean B. Lasserre
Abstract
We provide two algorithms for computing the volume of the convex polytope Ω : = {x ∈ ℝn+ | Ax ≤ b}, for A, ∈ ℝm×n, b ∈ ℝn. The computational complexity of both algorithms is essentially described by nm, which makes them especially attractive for large n and relatively small m, when the other methods with O(mn) complexity fail. The methodology, which differs from previous existing methods, uses a Laplace transform technique that is well suited to the half-space representation of Ω.
- BARVINOK, A. I. 1993. Computing the volume, couting integral points and exponentials sums, Discr. Comput. Geom. 10, 123-141.Google Scholar
Digital Library
- BRYCHKOY, Y. A., GLAESKE, H. J., PRUDNIKOY,A.P.,AND TUAN, V. K. 1992. Multidimensional Integral Transformations. Gordon and Breach, Philadelphia, Pa.Google Scholar
- BUELER, B., ENGE, A., AND FUKUDA, K. 2000. Exact volume computation for polytopes: A practical study. In: Polytopes-Combinatorics and Computation, G. Kalai, and G. M. Ziegler, Eds., Birhauser Verlag, Basel.Google Scholar
- COHEN, J., AND HICKEY, T. 1979. Two algorithms for determining volumes of convex polyhedra, J. ACM 26, 401-414. Google ScholarDigital Library
- CONWAY, J. B. 1978. Functions of a Complex Variable I, 2nd ed. Springer, New York.Google Scholar
- DYER, M. E. 1983. The complexity of vertex enumeration methods. Math. Oper. Res. 8, 381-402.Google ScholarDigital Library
- DYER,M.E.,AND FRIEZE, A. M. 1988. The complexity of computing the volume of a polyhedron. SIAM J. Comput. 17, 967-974. Google ScholarDigital Library
- GRITZMANN,P.,AND KLEE, V. 1994. Basic problems in computational convexity II. In Polytopes: Abstract; Convex and Computational, T. Bisztriczky, P. McMullen, R. Schneider, and A. I. Weiss, Eds. NATO ASI series, Kluwer Academic Publishers, Dordrecht.Google Scholar
- HIRIART-URRUTY, J.-B., AND LEMARECHAL, C. 1993. Convex Analysis and Minimization Algorithms I. Springer-Verlag, Berlin, Germany.Google Scholar
- LASSERRE, J. B. 1983. An analytical expression and an algorithm for the volume of a convex polyhedron in Rn. J. Optim. Theor. Appl. 39, 363-377.Google ScholarCross Ref
- LAWRENCE, J. 1991. Polytope volume computation, Math. Comput. 57, 259-271.Google ScholarCross Ref
- SCHRIJVER, A. 1986. Theory of Linear and Integer Programming, John Wiley & Sons, Chichester. Google ScholarDigital Library
- VON HOHENBALKEN, B. 1987. Finding simplicial subdivisions of polytopes, Math. Prog. 21, 233-234.Google ScholarDigital Library
Index Terms
- A Laplace transform algorithm for the volume of a convex polytope
Recommendations
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometryGiven a set Σ of spheres in Ed, with d≥3 and d odd, having a fixed number of m distinct radii ρ1,ρ2,...,ρm, we show that the worst-case combinatorial complexity of the convex hull CHd(Σ) of Σ is Θ(Σ{1≤i≠j≤m}ninj⌊ d/2 ⌋), where ni is the number of ...
New Lower Bounds for Convex Hull Problems in Odd Dimensions
We show that in the worst case, $\Omega(n^{\ceil{d/2}-1} + n\log n)$ sidedness queries are required to determine whether the convex hull of n points in $\Real^d$ is simplicial or to determine the number of convex hull facets. This lower bound matches ...
Combinatorially Two-Orbit Convex Polytopes
Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide). ...
Comments