Incremental convex hull algorithms are not output sensitive

Discrete and Computational Geometry

Volumn 21, Issue 1, 1999, Pages 57-68

  Bremner, D ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033484220     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009410     Document Type: Article

References (27)

1. D. Alevras, G. Cramer, and M. Padberg. DODEAL. 〈ftp://elib.zib-berlin.de/pub/ mathprog/polyth/dda〉.
2. A. Altshuler and M. Perles. Quotient polytopes of cyclic polytopes. Part I: Structure and characterization. Israel J. Math., 36(2):97-125, 1980.
3. D. Avis, D. Bremner, and R. Seidel. How good are convex hull algorithms? Comput. Geom.: Theory Appl., 7(5-6), 1997.
4. 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.
5. A. Brøndsted. Introduction to Convex Polytopes. Springer-Verlag, New York, 1981.
6. 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:1-7, 1994.
7. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. In: Proc. 11th ACM Svmp. Comp. Geom., pp. 10-19, 1995.
8. A. Charnes. The simplex method: Optimal set and degeneracy. In: An Introduction to Linear Programming, Lecture VI, pp. 62-70. Wiley, New York, 1953.
9. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10:377-409, 1993.
10. T. Christof and A. Loebel. Porta. March 1997. 〈http://www.iwr.uni-heidelberg.de/iwr/ comopt/soft/PORTA/readme.html〉.
11. 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, January 1996. Lecture Notes in Computer Science. Springer-Verlag, New York. To appear.
12. M. Dyer. The complexity of vertex enumeration methods. Math. Oper. Res., 8(3):381-402, 1983.
13. R. Euler and H. Le Verge. Complete linear descriptions of small asymetric travelling salesman polytopes. Discrete Appl. Math., 62:193-208, 1995.
14. K. Fukuda. cdd+ Reference manual, version 0.73. ETHZ, Zurich, Switzerland. 〈ftp://ifor13.ethz.ch/pub/fukuda/cdd〉.
15. 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.
16. K. Fukuda and A. Prodon. The Double Description Method Revisited. Lecture Notes in Computer Science, vol. 1120. Springer-Verlag, New York, 1996. To appear.
17. D. Gale. Neighborly and cyclic polytopes. Proc. 7th Symp. Pure Math. (V. Klee, Ed.). 1961.
18. B. Grünbaum. Convex Polytopes. Interscience, London, 1967.
19. V. Klee and G. Minty. How good is the simplex method? In Inequalities-III (O. Shisha, ed.). pp. 159-175. Academic Press, New York, 1972.
20. U. H. Kortenkamp, J. Richter-Gebert, A. Sarangarajan, and G. M. Ziegler. Extremal properties of 0/1-polytopes. Discrete Comput. Geom., 4(16), 1997.
21. P. McMullen. The maximal number of faces of a convex polytope. Mathematika, 17:179-184, 1970.
22. T. S. Motzkin, H. Raiffa, G. Thompson, and R. M. Thrall. The double description method. In Contributions to the Theory of Games II (H. Kuhn and A. Tucker, eds.). Annals of Math. Studies, vol. 8, pp. 51-73. Princeton University Press, Princeton, 1953.
23. J. A. Murtha and E. R. Willard. Linear Algebra and Geometry. Holt Rinehart and Winston, New York, 1969.
24. R. Seidel. Output-size sensitive algorithms for constructive problems in computational geometry. Ph.D. thesis, Department Computer Science, Cornell University, Ithaca, NY, 1986. Technical Report TR 86-784.
25. G. Swart. Finding the convex hull facet by facet. J. Algorithms, pp. 17-48, 1985.
26. D. K. Wilde. A library for doing polyhederal applications. Technical Report 785, IRISA, Campus Universitaire de Beaulieu, 35042 Rennes CEDEX France, 1993. 〈ftp://ftp.irisa.fr/local/API〉.
27. G. M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics. Springer-Verlag, New York, 1994.