Finding the convex hull of a simple polygon

Authors:
Jack Sklansky
Affiliations:
University of California, Irvine, CA 92717, U.S.A.
Venue:
Pattern Recognition Letters
Year:
1982

Citing 1
Cited 6

Measuring Concavity on a Rectangular Mosaic

IEEE Transactions on Computers

A counterexample to an algorithm for computing monotone hulls of simple polygons

Pattern Recognition Letters
A historical note on convex hull finding algorithms

Pattern Recognition Letters
On the application of the convex hull to histogram analysis in threshold selection

Pattern Recognition Letters
Convexity local contour sequences for gesture recognition

Proceedings of the 28th Annual ACM Symposium on Applied Computing
Multi-robot cooperative spherical-object tracking in 3D space based on particle filters

Robotics and Autonomous Systems
Gravity optimised particle filter for hand tracking

Pattern Recognition

Quantified Score

Hi-index	0.10

Visualization

Abstract

We describe a new algorithm for finding the convex hull of any simple polygon specified by a sequence of m vertices. An earlier convex hull finder of ours is limited to polygons which remain simple (i.e., nonselfintersecting) when locally non-convex vertices are removed. In this paper we amend our earlier algorithm so that it finds with complexity O(m) the convex hull of any simple polygon, while retaining much of the simplicity of the earlier algorithm.