Incremental convex hull algorithms are not output sensitive

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1178, Issue , 1996, Pages 26-35

  Bremner, David ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

CONVEX HULL; CONVEX HULL ALGORITHM; EXTREME POINTS; FINITE SET; GEOMETRIC DUALITY; HALF SPACES; HALF-SPACE; OUTPUT-SENSITIVE;

COMPUTATIONAL GEOMETRY;

EID: 84990210448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009478     Document Type: Conference Paper

References (26)

1. D. Alevras, G. Cramer, and M. Padberg. DODEAL.
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? To appear in Comput. Geom.: Theory and Appl., 1996.
4. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Disc. Comput. Geom., 8:295–313, 1992.
5. A. Brøndsted. Introduction to Convex Polytopes. Springer-Verlag, 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. Physical Review B, 49:1–7, 1994.
7. T. M. Chan. Output-sensitive results on convex hulls, extreme points, and related problems. In Proc. 11th ACM Symp. Comp. Geom., pages 10–19, 1995.
8. A. Charnes. The simplex method: optimal set and degeneracy. In An introduction to Linear Programming, Lecture VI, pages 62–70. Wiley, New York, 1953.
9. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Disc. Comput. Geom., 10:377–409, 1993.
10. T. Christof and A. Loebel. porta v1.2.2. April 1995.
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. To appear in Lecture Notes in Computer Science, Springer-Verlag.
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. Disc. App. Math., 62:193–208, 1995.
14. K. Fukuda. cdd+ Reference manual, version 0.73. ETHZ, Zurich, Switzerland.
15. K. Fukuda, T. M. Liebling, and F. Margot. Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. To appear in Comput. Geom.: Theory and Appl., 1996.
16. K. Fukuda and A. Prodon. The double description method revisited. In Lecture Notes in Computer Science, volume 1120. Springer-Verlag, 1996. To appear.
17. D. Gale. Neighborly and cyclic polytopes. In V. Klee, editor, Proc. 7th Symp. Pure Math., 1961.
18. B. Grünbaum. Convex Polytopes. Interscience, London, 1967.
19. V. Klee and G. Minty. How good is the simplex method? In O. Shisha, editor, Inequalities-III, pages 159–175. Academic Press, 1972.
20. P. McMullen. The maximal number of faces of a convex polytope. Mathematika, 17:179–184, 1970.
21. T. S. 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.
22. J. A. Murtha and E. R. Willard. Linear Algebra and Geometry. Holt Rinehart and Winston, New York, 1969.
23. R. Seidel. Output-size sensitive algorithms for constructive problems in computational geometry. Ph.D. thesis, Dept. Comput. Sci., Cornell Univ., Ithaca, NY, 1986. Technical Report TR 86-784.
24. G. Swart. Finding the convex hull facet by facet. J. Algorithms, pages 17–48, 1985.
25. D. K. Wilde. A library for doing polyhederal applications. Technical Report 785, IRISA, Campus Universitaire de Beaulieu-35042 Rennes CEDEX France, 1993.
26. G. M. Ziegler. Lectures on Polytopes. Graduate Texts in Mathematics. Springer-Verlag, 1994.