Advertisement

Double description method revisited

  • Komei Fukuda
  • Alain Prodon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)

Abstract

The double description method is a simple and useful algorithm for enumerating all extreme rays of a general polyhedral cone in ℝd, despite the fact that we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for efficient implementations, and show some empirical results indicating its practicality in solving highly degenerate problems.

Keywords

Generate Matrix Polyhedral Cone Vertex Enumeration Double Description Intermediate Cone 
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. [AB95]
    D. Avis, D. Bremner and R. Seidel. How good are convex hull algorithms. Computational Geometry: Theory and Applications (to appear).Google Scholar
  2. [AF92]
    D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom., 8:295–313, 1992.Google Scholar
  3. [Avi93]
    D. Avis. A C implementation of the reverse search vertex enumeration algorithm. School of Computer Science, McGill University, Montreal, Canada, 1993. programs lrs and qrs available via anonymous ftp from mutt.cs.mcgill.ca (directory pub/C).Google Scholar
  4. [BDH93]
    C.B. Barber, D.P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. Technical Report GCC53, The Geometry Center, Minnesota, U.S.A., 1993.Google Scholar
  5. [CGAF94]
    G. Ceder, G.D. Garbulsky, D. Avis, and K. Fukuda. Ground states of a ternary fcc lattice model with nearest and next-nearest neighbor interactions. Physical Review B, 49(1):1–7, 1994.CrossRefGoogle Scholar
  6. [Che65]
    N.V. Chernikova. An algorithm for finding a general formula for nonnegative solutions of system of linear inequalities. U.S.S.R Computational Mathematics and Mathematical Physics, 5:228–233, 1965.CrossRefGoogle Scholar
  7. [CR95]
    T. Christof and G. Reinelt. Combinatorial Optimization and Small Polytopes. To appear in TOP 96.Google Scholar
  8. [DDF95]
    A. Deza, M. Deza and K. Fukuda. On Skeletons, Diameters and Volumes of Metric Polyhedra. Proceedings CCS'95 (this issue).Google Scholar
  9. [DFL93]
    M. Deza, K. Fukuda, and M. Laurent. The inequicut cone. Discrete Mathematics, 119:21–48, 1993.CrossRefGoogle Scholar
  10. [Dye83]
    M.E. Dyer. The complexity of vertex enumeration methods. Math. Oper. Res., 8:381–402, 1983.Google Scholar
  11. [Ede87]
    H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.Google Scholar
  12. [Fuk93]
    K. Fukuda. cdd.c: C-implementation of the double description method for computing all vertices and extremal rays of a convex polyhedron given by a system of linear inequalities. Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, Switzerland, 1993. program available from ifor13.ethz.ch (129.132.154.13), directory /pub/fukuda/cdd.Google Scholar
  13. [Grü67]
    B. Grünbaum. Convex Polytopes. John Wiley and Sons, New York, 1967.Google Scholar
  14. [MRTT53]
    T.S. Motzkin, H. Raiffa, GL. Thompson, and R.M. Thrall. The double description method. In H.W. Kuhn and A.W. Tucker, editors, Contributions to theory of games, Vol. 2. Princeton University Press, Princeton. RI, 1953.Google Scholar
  15. [MS71]
    P. McMullen and G.C. Shephard. Convex Polytopes and the Upperbound Conjecture. Cambridge University Press, 1971.Google Scholar
  16. [Mul94]
    K. Mulmuley. Computational Geometry, An Introduction Through Randamized Algorithms. Prentice-Hall, 1994.Google Scholar
  17. [Sch86]
    A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, 1986.Google Scholar
  18. [Ver92]
    H. Le Verge. A note on Chernikova's algorithm. Technical report internal publication 635, IRISA, Rennes, France, February 1992.Google Scholar
  19. [Wil93]
    D. Wilde. A library for doing polyhedral operations. Technical report internal publication 785, IRISA, Rennes, France, December 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Komei Fukuda
    • 1
  • Alain Prodon
    • 2
  1. 1.Institute for Operations ResearchETHZZürichSwitzerland
  2. 2.Department of MathematicsEPFLLausanneSwitzerland

Personalised recommendations