A New Convex Hull Algorithm for Planar Sets
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A new algorithm, CONVEX, that determines which points of a planar set are vertices of the convex hull of the set is presented and it is shown thatCONVEX operates in a fashion similar to the sorting algorithm QUICKERSORT.
Abstract
article Free Access Share on A New Convex Hull Algorithm for Planar Sets Author: William F. Eddy Department of Statistics, Carnegie-Mellon University, Schenley Park, Pittsburgh, PA Department of Statistics, Carnegie-Mellon University, Schenley Park, Pittsburgh, PAView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 3Issue 4Dec. 1977 pp 398–403https://doi.org/10.1145/355759.355766Online:01 December 1977Publication History 173citation1,590DownloadsMetricsTotal Citations173Total Downloads1,590Last 12 Months148Last 6 weeks24 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF