A New Convex Hull Algorithm for Planar Sets

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A New Convex Hull Algorithm for Planar Sets

Full text

Pdf (368 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 3 , Issue 4 (December 1977) table of contents

Pages: 398 - 403

Year of Publication: 1977

ISSN:0098-3500

Author

William F. Eddy

Department of Statistics, Carnegie-Mellon University, Schenley Park, Pittsburgh, PA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 101, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/355759.355766 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	GRAHAM, R.L. An efficient algorithm for determining the convex hull of a planar set. Inform. Prec. Letlers 1 (1972), 132-133.
	2	J ARraS, R.A. On the identification of the convex hull of a finite set of points in the plane. Inform. Prec. Letters ~ (1973), 18-21.
	3	PREPARATA, F.P., AND HONG, S.J. Convex hulls of finite planar and spatial sets of points. Report R-682, Coordinated Science Lab., U. of Illinois, Urbana, Ill., April 1975.
	4	PR~PARA~A, F.P., AND HONe, S.J. Convex hulls of planar and spatial sets of points. Abstract 726-68-1, Notices AM~J 2~ (1975), A-596.
	5	RAYNAUD, H. Sur l'enveloppe convexe des nuages de points aleatoires dans Ra.I.J. Appl. Prob. 7 (1970), 35-48.
	6	R. S. Scowen, Algorithm 271: quickersort, Communications of the ACM, v.8 n.11, p.669-670, Nov. 1965 [doi>10.1145/365660.365678]

CITED BY 9

	W. F. Eddy, Algorithm 523: CONVEX, A New Convex Hull Algorithm for Planar Sets [Z], ACM Transactions on Mathematical Software (TOMS), v.3 n.4, p.411-412, Dec. 1977
	M. Golin , R. Sedgewick, Analysis of a simple yet efficient convex hull algorithm, Proceedings of the fourth annual symposium on Computational geometry, p.153-163, June 06-08, 1988, Urbana-Champaign, Illinois, United States
	S. B. Tor , A. E. Middleditch, Convex Decomposition of Simple Polygons, ACM Transactions on Graphics (TOG), v.3 n.4, p.244-265, Oct. 1984
	Mark H. Overmars , Jan van Leeuwen, Dynamically maintaining configurations in the plane (Detailed Abstract), Proceedings of the twelfth annual ACM symposium on Theory of computing, p.135-145, April 28-30, 1980, Los Angeles, California, United States
	Hla Min , S. Q. Zheng, Time-space optimal convex Hull algorithms, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.687-693, February 14-16, 1993, Indianapolis, Indiana, United States
	Hervé Brönnimann , John Iacono , Jyrki Katajainen , Pat Morin , Jason Morrison , Godfried Toussaint, Space-efficient planar convex hull algorithms, Theoretical Computer Science, v.321 n.1, p.25-40, June 16, 2004
	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
	G. Millerioux , F. Anstett , G. Bloch, Considering the attractor structure of chaotic maps for observer-based synchronization problems, Mathematics and Computers in Simulation, v.68 n.1, p.67-85, 3 February 2005
	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