Degenerate convex hulls in high dimensions without extra storage

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Degenerate convex hulls in high dimensions without extra storage

Full text

Pdf (653 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the eighth annual symposium on Computational geometry table of contents

Berlin, Germany

Pages: 26 - 32

Year of Publication: 1992

ISBN:0-89791-517-8

Author

Günter Rote

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 16, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/142675.142685 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	David Avis , Komei Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete & Computational Geometry, v.8 n.3, p.295-313, 1992 [doi>10.1007/BF02293050]
	2	Andries E. Brouwer, Arjeh M. Cohen, and Arnold Neumaier {1989} Distance-regular graphs, Springer-Verlag.
	3	Donald R. Chand , Sham S. Kapur, An Algorithm for Convex Polytopes, Journal of the ACM (JACM), v.17 n.1, p.78-86, Jan. 1970 [doi>10.1145/321556.321564]
	4	Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard {1991} On-line and off-line vertex enumeration by adjacency lists, Oper. Res. Lett. 10, 403-409.
	5	T. Christof, M. Jiinger, and G. Reinelt {1990} A complete description of the traveling salesman polytope on 8 nodes, report 249-1990, Universit/~t Augsburg, Institut f/ir Mathematik.
	6	T. H. Matheiss and D. S. Rubin {1980} A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets, Math. Oper. Res. 5, 167-185.
	7	W. R. Pulleyblank, Polyhedral combinatorics, Optimization, Elsevier North-Holland, Inc., New York, NY, 1989
	8	Raimund Seidel, Linear programming and convex hulls made easy, Proceedings of the sixth annual symposium on Computational geometry, p.211-215, June 07-09, 1990, Berkley, California, United States [doi>10.1145/98524.98570]
	9	Micha Sharir , Emo Welzl, A Combinatorial Bound for Linear Programming and Related Problems, Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, p.569-579, February 13-15, 1992
	10	G. Swart {1985} Finding the convex hull facet by facet, J. Algorithms 6, 17-48.

CITED BY 3

	Hervé Brönnimann, Degenerate convex hulls on-line in any fixed dimension, Proceedings of the fourteenth annual symposium on Computational geometry, p.249-258, June 07-10, 1998, Minneapolis, Minnesota, United States
	Tomonari Masada , Hiroshi Imai , Keiko Imai, Enumeration of regular triangulations, Proceedings of the twelfth annual symposium on Computational geometry, p.224-233, May 24-26, 1996, Philadelphia, Pennsylvania, United States
	Jeff Erickson, New lower bounds for convex hull problems in odd dimensions, Proceedings of the twelfth annual symposium on Computational geometry, p.1-9, May 24-26, 1996, Philadelphia, Pennsylvania, United States