How good are convex hull algorithms?

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 20-28

  Avis, David ^a   Bremner, David ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85015768648     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220282     Document Type: Conference Paper

References (22)

1. 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.
2. B. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hull. Technical Report GCG53, The Geometry Center, University of Minnesota, July 1993.
3. M. Bayer and C. Lee. Combinatorial aspects of convex polytopes. In P. Gruber and J. Wills, editors, Handbook of Convex Geometry, volume A, chapter 2.3, pages 485-534. North Holland, New York, NY, 1993.
4. A. Brøndsted. Introduction to Convex Polytopes. Springer Verlag, 1981.
5. G. Ceder, G. Garbulsky, D. Avis, and K. Fukuda. Ground states of a ternary lattice model with nearest and next-nearest neighbor interactions. Physical Review B, 49:1-7, 1994.
6. D. Chand and S. Kapur. An algorithm for convex polytopes. J. ACM, 17:78-86, 1970.
7. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10:377-409, 1993.
8. V. Chvátal. Linear Programming. W. H. Freeman, New York, NY, 1983.
9. K. L. Clarkson and P. W. Shor. Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental. In Proc. 4th Annu. ACM Sympos. Comput. Geom., pages 12-17, 1988.
10. M. Dyer. The complexity of vertex enumeration methods. Math. Open Res., 8(3):381-402, 1983.
11. K. Fukuda. cdd Reference manual, version 0.52b. EPFL, Lausanne, Switzerland.
12. I. Gel'fand, M. Kapranov, and A. Zelevinsky. Discriminants, resultants, and multidimensional determinants. Mathematics: theory & applications. Birkhauser, Boston, 1994.
13. M. Haiman. A simple and relatively efficient triangulation of the n-cube. Discrete Comput. Geom., pages 287-289, 1991.
14. V. Klee. Polytope pairs and their relationship to linear programming. ActaMath., 133:1-25, 1974.
15. V. Klee and G. Minty. How good is the simplex method? In O. Shisha, editor, Inequalities-III, pages 159-175. Academic Press, 1972.
16. L'Ecuyer. Efficient and portable combined random number generators. Communications of the ACM, 31, 1988.
17. L'Ecuyer and Tezuka. Structural properties for two classes of combined random number generators. Mathematics of Computation, 57, 1991.
18. C. W. Lee. Regular triangulations of convex polytopes. In The Victor Klee Festschrift, volume 4 of DIM A CS Series in Discrete Mathematics and Theoretical Computer Science, pages 443-456. American Mathematical Society, 1991.
19. T. Motzkin, H. Raiffa, G. Thompson, and R. M. Thrall. The double description method. In H. Kuhn and A. Tucker, editors, Contributions to the Theory of Games II, volume 8 of Annals of Math. Studies, pages 51-73. Princeton University Press, 1953.
20. R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. Technical report, University of British Columbia, Dept. of Computer Science, 1981.
21. R. Seidel. Constructing higher-dimensional convex hulls at logarithmic cost per face. In Proc. 18th Annu. ACM Sympos. Theory Comput., pages 404-413, 1986.
22. C.-K. Yap. Symbolic treatment of geometric dependancies. J. Symbolic Computation, 10:349-370, 1990.