How good are convex hull algorithms?

Computational Geometry: Theory and Applications

Volumn 7, Issue 5-6, 1997, Pages 265-301

  Avis, David ^a   Bremner, David ^a   Seidel, Raimund ^b,c  

^a MCGILL UNIVERSITY   (Canada)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

Convex hulls; Convex polytopes; Lattice complexity; Triangulation complexity; Vertex enumeration

Indexed keywords

EID: 0001755947     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00023-5     Document Type: Article

References (38)

1. P. Armand, Bounds on the number of vertices of polyhedra, Ann. Oper. Res. 47 (1993) 249-269.
2. D. Avis and D. Bremner, How good are convex hull algorithms? in: Proc. 11th Ann. ACM Sympos. Comput. Geom. (1995) 20-28.
3. D. Avis and A. Deza, Solitaire cones, Technical Report SOCS-96.8, McGill University, School of Computer Science, September 1996.
4. 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.
5. B. Bradford Barber, D.P. Dobkin and H. Huhdanpaa, The quickhull algorithm for convex hull, ACM Trans. on Mathematical Software, to appear.
6. D.W. Barnette, The minimum number of vertices of a simple polytope, Israel J. Math. 8 (1971) 304-308.
7. M.M. Bayer and C.W. Lee, Combinatorial aspects of convex polytopes, in: P. Gruber and J. Wills, eds., Handbook of Convex Geometry, Vol. A (North-Holland, New York, 1993) 485-534.
8. A. Brøndsted, Introduction to Convex Polytopes (Springer, 1981).
9. G. Ceder, G. Garbulsky, D. Avis and K. Fukuda, Ground states of a ternary lattice model with nearest and next-nearest neighbor interactions, Phys. Rev. B 49 (1994) 1-7
10. D. Chand and S. Kapur, An algorithm for convex polytopes, J. ACM 17 (1970) 78-86.
11. B. Chazelle, An optimal convex hull algorithm in any fixed dimension, Discrete Comput. Geom. 10 (1993) 377-409.
12. V. Chvátal, Linear Programming (Freeman, New York, 1983).
13. K.L. Clarkson, More output-sensitive geometric algorithms, in: Proc. 35th IEEE Sympos. Found. Comput. Sci. (1994) 695-702.
14. K. L. Clarkson and P.W. Shor, Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental, in: Proc. 4th Ann. ACM Sympos. Comput. Geom. (1988) 12-17.
15. A. Deza, M. Deza and K. Fukuda, On skeletons, diameters and volumes of metric polyhedra, Technical Report, Laboratoire d'Informatique de l'Ecole Supérieure (1996).
16. M.E. Dyer, The complexity of vertex enumeration methods, Math. Oper. Res. 8(3) (1983) 381-402.
17. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science 10 (Springer, Berlin, 1987) 147-158.
18. K. Fukuda, cdd Reference Manual, Version 0.55 (EPFL, Lausanne, Switzerland).
19. K. Fukuda, mit71-61.ine solved, Private communication (1996).
20. T. Gal, Selected bibliography on degeneracy, Ann. Oper. Res. 47 (1993) 1-8.
21. V. P. Grishukin, Computing extreme rays of the metric cone for seven points, European J. Combinatorics 13 (1992) 153-165.
22. B. Grünbaum, Convex Polytopes (Interscience, London, 1967).
23. M. Haiman, A simple and relatively efficient triangulation of the n-cube, Discrete Comput. Geom. 6 (1991) 287-289.
24. T.P. Kirkman, On the enumeration of x-hedra having triedal summits and an (x - 1)-gonal base, Philos. Trans. Roy. Soc. London Ser. A 146 (1856) 399-411.
25. V. Klee, Polytope pairs and their relationship to linear programming, Acta Math. 133 (1974) 1-25.
26. V. Klee and G.J. Minty, How good is the simplex method? in: O. Shisha, ed., Inequalities-III (Academic Press, New York, 1972) 159-175.
27. P. L'Ecuyer, Efficient and portable combined random number generators, Comm. ACM 31 (1988)
28. J. Matoušek and O. Schwarzkopf, Linear optimization queries, in: Proc. 8th Ann. ACM Sympos. Comput. Geom. (1992) 16-25.
29. P. McMullen, The maximal number of faces of a convex polytope, Mathematica 17 (1970) 179-184.
30. T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, The double description method, in: H.W. Kuhn and A.W. Tucker, eds., Contributions to the Theory of Games II, Annals of Mathematics Studies (Princeton University Press, Princeton, NJ, 1953) 51-73.
31. J.S. Provan, Efficient enumeration of the vertices of polyhedra associated with network LP's, Math. Programming 63 (1994) 47-64.
32. G. Rote, Degenerate convex hulls in high dimensions without extra storage, in: Proc. 8th ACM Sympos. Comput. Geom. (1992) 26-32.
33. R. Seidel, The nature and meaning of perturbations in geometric computing, Discrete Comput. Geom., to appear.
34. R. Seidel, A convex hull algorithm optimal for point sets in even dimensions, Technical Report, University of British Columbia, Dept. of Computer Science (1981).
35. R. Seidel, Output-size sensitive algorithms for constructive problems in computational geometry, Ph.D. Thesis, Dept. Comput. Sci., Cornell University, Ithaca, NY (1986); also: Technical Report TR 86-784.
36. G. Swart, Finding the convex hull facet by facet, J. Algorithms (1985) 17-48.
37. G. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics (Springer, Berlin, 1994).
38. D. Bremner, Incremental convex hull algorithms are not output sensitive, in: Proc. ISAAC '96, Lecture Notes in Computer Science 1178 (Springer, Berlin, December 1996) 26-35.