Advertisement

Volume Computation Using a Direct Monte Carlo Method

  • Sheng Liu
  • Jian Zhang
  • Binhai Zhu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4598)

Abstract

Volume computation is a traditional, extremely hard but highly demanding task. It has been widely studied and many interesting theoretical results are obtained in recent years. But very little attention is paid to put theory into use in practice. On the other hand, applications emerging in computer science and other fields require practically effective methods to compute/estimate volume. This paper presents a practical Monte Carlo sampling algorithm on volume computation/estimation and a corresponding prototype tool is implemented. Preliminary experimental results on lower dimensional instances show a good approximation of volume computation for both convex and non-convex cases. While there is no theoretical performance guarantee, the method itself even works for the case when there is only a membership oracle, which tells whether a point is inside the geometric body or not, and no description of the actual geometric body is given.

Keywords

Convex Body Random Point Volume Computation Convex Polyhedron Prototype Tool 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Applegate, D., Kannan, R.: Sampling and integration of near log-concave functions. In: Proc. 23rd annual ACM symp. on Theory of Computing (STOC), pp. 156–163 (1991)Google Scholar
  2. 2.
    Bollobás, B.: Volume estimates and rapid mixing. Flavors of geometry. Math. Sci. Res. Inst. Publ. 31, 151–182 (1997)Google Scholar
  3. 3.
    Büeler, B., Enge, A., Fukuda, K.: Exact volume computation for polytopes: a practical study. Polytopes–combinatorics and computation (1998)Google Scholar
  4. 4.
    Dyer, M., Frieze, A.: On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5), 967–974 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dyer, M., Frieze, A.: Computing the volume of convex bodies: A case where randomness provably helps. In: Proc. 44th Symp. in Applied Mathematics (PSAM) (1991)Google Scholar
  6. 6.
    Dyer, M., Frieze, A., Kannan, R.: A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM 38(1), 1–17 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Gritzmann, P., Klee, V.: On the complexity of some basic problems in computational convexity: II. volume and mixed volumes. Polytopes: abstract, convex and computational (Scarborough, ON, 1993), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pp. 373–466 (1994)Google Scholar
  8. 8.
    Kannan, R., Lovász, L., Simonovits, M.: Random walks and an O*(n5) volume algorithm for convex bodies. Random Struct. Algorithms 11(1), 1–50 (1997)zbMATHCrossRefGoogle Scholar
  9. 9.
    ó Lovász, L.: How to compute the volume? Jber. d. Dt. Math.-Verein, Jubiläumstagung, B. G. Teubner, Stuttgart, pp. 138–151 (1990)Google Scholar
  10. 10.
    Lovász, L., Simonovits, M.: The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In: Proc. 31th IEEE Annual Symp. on Found. of Comp. Sci (FOCS), pp. 482–491 (1990)Google Scholar
  11. 11.
    Lovász, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4(4), 359–412 (1993)zbMATHCrossRefGoogle Scholar
  12. 12.
    Lovász, L., Vempala, S.: Simulated annealing in convex bodies and an O*(n4) volume algorithm. In: ó Lovász, L. (ed.) Proc. 44th IEEE Annual Symp. on Found. of Comp. Sci (FOCS), pp. 650–659 (2003)Google Scholar
  13. 13.
    Rademacher, L., Vempala, S.: Dispersion of mass and the complexity of randomized geometric algorithms. In: Proc. 47th IEEE Annual Symp. on Found. of Comp. Sci (FOCS), pp. 729–738 (2006)Google Scholar
  14. 14.
    Simonovits, M.: How to compute the volume in high dimension? Mathematical Programming 97, 337–374 (2003)zbMATHMathSciNetGoogle Scholar
  15. 15.
    Weisstein, E.: Ball. From MathWorld – A Wolfram Web Resource (2003), available at http://mathworld.wolfram.com/Ball.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sheng Liu
    • 1
    • 2
  • Jian Zhang
    • 1
  • Binhai Zhu
    • 3
  1. 1.State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080China
  2. 2.Graduate School, Chinese Academy of Sciences, Beijing 100049China
  3. 3.Department of Computer Science, Montana State University, Bozeman, MT 59717-3880USA

Personalised recommendations