# Duncan McCallum

- Citations Per Year

- Citations Per Year

Learn More

It is well known that the convex hull of a set of n points in the (Euclidean) plane can be-_ found by an algorithm having worst-case complexity O(n log n). In this note WC give a short linear algorithm for finding the convex hull in the, case that the (ordered) set of points from the vertices of a simple (i.e., non-self-intersecting) polygon.

- ‹
- 1
- ›