Primal-dual methods for vertex and facet enumeration

Discrete and Computational Geometry

Volumn 20, Issue 3, 1998, Pages 333-357

  Bremner, D ^a   Fukuda, K ^b,c   Marzetta, A ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b EPFL   (Switzerland)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032336939     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009389     Document Type: Article

References (18)

1. D. Avis. A C implementation of the reverse search vertex enumeration algorithm. Technical Report RIMS Kokyuroku 872, Kyoto University, May 1994. (Revised version of Technical Report SOCS-92.12, School of Computer Science, McGill University).
2. D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms? Comput. Geom. Theory Appl., 7(5-6):265-301, 1997.
3. 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.
4. D.W. Barnette. The minimum number of vertices of a simple polytope. Israel J. Math., 10:121-125, 1971.
5. A. Brøndsted. Introduction to Convex Polytopes. Springer-Verlag, Berlin, 1981.
6. D. Chand and S. Kapur. An algorithm for convex polytopes. J. Assoc. Comput. Mach., 17:78-86, 1970.
7. V. Chvátal. Linear Programming. Freeman, New York, 1983.
8. K. L. Clarkson. More output-sensitive geometric algorithms. In Proc. 35th IEEE Symp. Found. Comput. Sci., pages 695-702, 1994.
9. M. Dyer. The complexity of vertex enumeration methods. Math. Oper. Res., 8(3):381-402, 1983.
10. J. Edmonds. Decomposition using Minkowski. Abstracts of the 14th International Symposium on Mathematical Programming, Amsterdam, 1991.
11. K. Fukuda, T. M. Liebling, and F. Margot. Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. Comput. Geom. Theory Appl., 8:1-12, 1997.
12. P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes. In T. Bisztriczky, P. McMullen, R. Schneider, and A. I. Weiss, editors, Polytopes: Abstract, Convex, and Computational, number 440 in NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pages 373-466. Kluwer, Dordrecht, 1994.
13. J. P. Ignizio and T. M. Cavalier. Linear Programming, pages 118-122. Prentice-Hall International Series in Industrial and Systems Engineering. Prentice-Hall, Englewood Cliffs, NJ, 1994.
14. V. Klee. Extreme points of convex sets without completeness of the scalar field. Mathematika, 11:59-63, 1964.
15. K. Mehlhorn. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, volume 3 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, 1984.
16. K. Murty. The gravitational method for linear programming. Opsearch, 23:206-214, 1986.
17. R. Seidel. Output-size sensitive algorithms for constructive problems in computational geometry. Ph.D. thesis. Technical Report TR 86-784, Dept. Computer Science, Cornell University, Ithaca, NY, 1986.
18. G. Swart. Finding the convex hull facet by facet. J. Algorithms, 6:17-48, 1985.