Double description method revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1120, Issue , 1996, Pages 91-111

  Fukuda, Komei ^a   Prodon, Alain ^b  

^a ETH ZURICH   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEGENERATE PROBLEMS; DOUBLE DESCRIPTION; EFFICIENT IMPLEMENTATION; POLYHEDRAL CONE; TIME AND SPACE COMPLEXITY;

COMBINATORIAL MATHEMATICS;

EID: 84947909628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61576-8_77     Document Type: Conference Paper

References (19)

1. D. Avis, D. Brenmer and R. Seidel. How good are convex hull algorithms. COmputational Geometry: Theory and Applications (to appear).
2. 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.
3. 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.mcgiU.ca (directory pub/C).
4. 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.
5. 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.
6. N.V. Oaernikova. 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.
7. T. Christof and G. Reinelt. Combinatorial Optimization and Small Polytopes. To appear in TOP 96.
8. A. Deza, M. Deza and K. Fukuda. On Skeletons, Diameters and Volumes of Metric Polyhedra. Proceedings CCS’95 (this issue).
9. M. Deza, K. Fukuda, and M. Laurent. The inequicut cone. Discrete Mathematics, 119:21-48, 1993.
10. M.E. Dyer. The complexity of vertex enumeration methods. Math. Oper. Res., 8:381-402, 1983.
11. H. Edelsbrurmer. Algorithms in Combinatorial Geometry. Springer-Verlag, 1987.
12. 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 iforl3.ethz.ch (129.132.154.13), directory /pub/fukuda/cdd.
13. B. Grünbaum. Convex Polytopes. John Wiley and Sons, New York, 1967.
14. 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.
15. P. McMullen and G.C. Shephard. Convex Polytopes and the Upperbound Conjecture. Cambridge University Press, 1971.
16. K. Mulmuley. Computational Geometry, An Introduction Through Ran. damized Algorithms. Prentice-Hall, 1994.
17. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, 1986.
18. H. Le verge. A note on Chernikova’s algorithm. Technical report internal publication 635, IRISA, Rennes, France, February 1992.
19. D. Wilde. A library for doing polyhedral operations. Technical report intenal publication 785, IRISA, Rennes, France, December 1993.