Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time
We present space-efficient algorithms for computing the convex hull of a simple polygonal line in-place, in linear time. It turns out that the problem is as hard as stable partition, i.e., if there were a truly simple solution then stable partition would also have a truly simple solution, and vice versa. Nevertheless, we present a simple self-contained solution that uses O(log n) space, and indicate how to improve it to O(1) space with the same techniques used for stable partition. If the points inside the convex hull can be discarded, then there is a truly simple solution that uses a single call to stable partition, and even that call can be spared if only extreme points are desired (and not their order). If the polygonal line is closed, then the problem admits a very simple solution which does not call for stable partitioning at all.
KeywordsConvex Hull Convex Polygon Simple Polygon Polygonal Line Current Vertex
Unable to display preview. Download preview PDF.
- 1.Aloupis, G.: A History of Linear-time Convex Hull Algorithms for Simple Polygons, http://cgm.cs.mcgill.ca/~athens/cs601/
- 3.Brönnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., Toussaint, G.T.: Space-efficient planar convex hull algorithms. To appear in Theoretical Computer Science (2002); Special issue of selected papers from Rajsbaum, S. (ed.): LATIN 2002. LNCS, vol. 2286. Springer, Heidelberg (2002)Google Scholar
- 5.Chen, E.Y., Chan, T.M.: A Space-Efficient Algorithm for Segment Intersection. In: Proc. 15th Canadian Conference on Computational Geometry, pp. 68–71 (2003)Google Scholar