Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron

Computational Geometry: Theory and Applications

Volumn 8, Issue 1, 1997, Pages 1-12

  Fukuda, Komei ^a   Liebling, Thomas M ^b   Margot, François ^b  

^a ETH ZURICH   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010541632     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(95)00049-6     Document Type: Article

References (18)

1. D. Avis and K. Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete Comput. Geom. 8 (1992) 295-313.
2. D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Appl. Math., to appear.
3. M.L. Balinski, An algorithm for finding all vertices of convex polyhedral sets, SIAM J. Appl. Math. 9 (1961) 72-81.
4. R. Chandrasekaran, S.N. Kabadi and K.G. Murty, Some NP-complete problems in linear programming, Oper. Res. Lett. 1 (1982) 101-104.
5. M.E. Dyer, The complexity of vertex enumeration methods, Math. Oper. Res. 8 (1983) 381-402.
6. H. Edelsbrunner, Algorithms in Combinatorial Geometry (Springer, New York, 1987).
7. K. Fukuda and T. Matsui, Finding all minimum cost perfect matchings in bipartite graphs, Networks 22 (1992) 461-468.
8. K. Fukuda and T. Matsui, Finding all the perfect matchings in bipartite graphs, Appl. Math. Lett. 7 (1994) 15-18.
9. M.R. Garey and D.S. Johnson, Computers and Intractability, a Guide to the Theory of NP-completeness, (Freeman, New York, 1979).
10. F. Margot, K. Fukuda and Th.M. Liebling, Enumeration of full dimensional cells in an arrangement, Working paper RO920918, EPF Lausanne, Switzerland.
11. T.H. Mattheiss, An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Oper. Res. 21 (1973) 247-260.
12. P. McMullen and G.C. Shephard, Convex Polytopes and the Upper Bound Conjecture (Cambridge University Press, Cambridge, 1971).
13. T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, The double description method, in: H.W. Kühn and A. W. Tucker, eds., Contribution to the Theory of Games, II, Ann. of Math. Stud. 8 (Princeton University Press, Princeton, NJ, 1953) 51-73.
14. K.G. Murty and S.-J. Chung, Segments in enumerating faces, Math. Programming 70 Ser. A (1995) 27-45.
15. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
16. R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proc. 18th ACM STOC (1986) 404-413.
17. A. Schrijver, Theory of Linear and Integer Programming (Wiley, New York, 1986).
18. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979) 410-421.