ACM

Communications of the ACM

Home/Magazine Archive/July 1979 (Vol. 22, No. 7)/An optimal real-time algorithm for planar convex hulls/Abstract

An optimal real-time algorithm for planar convex hulls

By F. P. Preparata
Communications of the ACM, July 1979, Vol. 22 No. 7, Pages 402-405
10.1145/359131.359132
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

An algorithm is described for the construction in real-time of the convex hull of a set of n points in the plane. Using an appropriate data structure, the algorithm constructs the convex hull by successive updates, each taking time O(log n), thereby achieving a total processing time O(n log n).

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.