An Algorithm for Convex Polytopes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Algorithm for Convex Polytopes

Full text

Pdf (412 KB)

Source

Journal of the ACM (JACM) archive
Volume 17 , Issue 1 (January 1970) table of contents

Pages: 78 - 86

Year of Publication: 1970

ISSN:0004-5411

Authors

Donald R. Chand	Advanced Computing Techniques Department, Lockheed-Georgia Company, Marietta, Georgia
Sham S. Kapur	Research Laboratory, Lockheed-Georgia Company, Marietta, Georgia

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 13, Downloads (12 Months): 92, Citation Count: 26

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/321556.321564 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	EGGLESTON, H.G. Convexity. Cambridge U. Press, New York and London, 1958.
	2	KLEE, V. Convex polytopes and linear programming. Rep. I)1-82-0374, Boeing Scientific Research Labs., Seattle, Wash., 1964.
	3	WETS, R. J.-B., AND WITZGALI,, C. Towards an algebraic characterization of convex polyhedral cones. Numer. Math. 12 (1968), 134-138.

CITED BY 26

	R. A. Dwyer, Higher-dimensional Voronoi diagrams in linear expected time, Proceedings of the fifth annual symposium on Computational geometry, p.326-333, June 05-07, 1989, Saarbruchen, West Germany
	C. Bradford Barber , David P. Dobkin , Hannu Huhdanpaa, The quickhull algorithm for convex hulls, ACM Transactions on Mathematical Software (TOMS), v.22 n.4, p.469-483, Dec. 1996
	Timothy M. Chan, Output-sensitive results on convex hulls, extreme points, and related problems, Proceedings of the eleventh annual symposium on Computational geometry, p.10-19, June 05-07, 1995, Vancouver, British Columbia, Canada
	Christoph Burnikel , Kurt Mehlhorn , Stefan Schirra, On degeneracy in geometric computations, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.16-23, January 23-25, 1994, Arlington, Virginia, United States
	F. P. Preparata , S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Communications of the ACM, v.20 n.2, p.87-93, Feb. 1977
	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
	David Bremner , Komei Fukuda , Ambros Marzetta, Primal-dual methods for vertex and facet enumeration (preliminary version), Proceedings of the thirteenth annual symposium on Computational geometry, p.49-56, June 04-06, 1997, Nice, France
	Azriel Rosenfeld, Progress in Picture Processing: 1969--71, ACM Computing Surveys (CSUR), v.5 n.2, p.81-108, June 1973
	Günter Rote, Degenerate convex hulls in high dimensions without extra storage, Proceedings of the eighth annual symposium on Computational geometry, p.26-32, June 10-12, 1992, Berlin, Germany
	V Visvanathan , L S Milor, An efficient algorithm to determine the image of a parallelepiped under a linear transformation, Proceedings of the second annual symposium on Computational geometry, p.207-215, June 02-04, 1986, Yorktown Heights, New York, 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
	Mujtaba R. Ghouse , Michael T. Goodrich, In-place techniques for parallel convex hull algorithms (preliminary version), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.192-203, July 21-24, 1991, Hilton Head, South Carolina, United States
	K Clarkson, A probabilistic algorithm for the post office problem, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.175-184, May 06-08, 1985, Providence, Rhode Island, United States
	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
	David Avis , Komei Fukuda, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Proceedings of the seventh annual symposium on Computational geometry, p.98-104, June 10-12, 1991, North Conway, New Hampshire, United States
	J. Chomicki , D. Q. Goldin , G. M. Kuper, Variable independence and aggregation closure, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.40-48, June 04-06, 1996, Montreal, Quebec, Canada
	Shouhong Wang, Nonlinear pattern hypothesis generation for data mining, Data & Knowledge Engineering, v.40 n.3, p.273-283, March 2002
	David Avis , David Bremner, How good are convex hull algorithms?, Proceedings of the eleventh annual symposium on Computational geometry, p.20-28, June 05-07, 1995, Vancouver, British Columbia, Canada
	D. P. Dobkin , M. J. Laszlo, Primitives for the manipulation of three-dimensional subdivisions, Proceedings of the third annual symposium on Computational geometry, p.86-99, June 08-10, 1987, Waterloo, Ontario, Canada
	Christian Ronse, A Bibliography on Digital and Computational Convexity (1961-1988), IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.2, p.181-190, February 1989
	Leonid Khachiyan , Endre Boros , Konrad Borys , Khaled Elbassioni , Vladimir Gurvich, Generating all vertices of a polyhedron is hard, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.758-765, January 22-26, 2006, Miami, Florida
	Mark J. Post, Minimum spanning ellipsoids, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.108-116, December 1984
	Jihong Lee, Velocity workspace analysis for multiple arm robot systems, Robotica, v.19 n.5, p.581-591, August 2001
	Flavio Firmani , Alp Zibil , Scott b. Nokleby , Ron p. Podhorodeski, Wrench capabilities of planar parallel manipulators. part i: Wrench polytopes and performance indices, Robotica, v.26 n.6, p.791-802, November 2008
	Nicolas Normand , Pierre Evenou, Medial axis lookup table and test neighborhood computation for 3D chamfer norms, Pattern Recognition, v.42 n.10, p.2288-2296, October, 2009
	Hichem Barki , Florence Denis , Florent Dupont, Contributing vertices-based Minkowski sum computation of convex polyhedra, Computer-Aided Design, v.41 n.7, p.525-538, July, 2009