Abstract
The problem of determining the convex hull of a simple polygon has received a lot of attention in the early eighties. The first linear time algorithm for this task was proposed by Sklansky (1972). Sklansky’s Algorithm can be described as follows:
Start at an extreme point of the polygon. Delete all left turns while moving around the polygon in clockwise direction. After each step backtrack until the path from the starting point to the point currently considered given by the not (yet) deleted points has right turns only.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bhattacharya B, Elgindy H (1984) A New Linear Convex Hull Algorithm for Simple Polygons. IEEE Trans. Inform. Theory, vol. IT-30, no. 1: 85–88
Ghosh S, Shyamasundar R (1983) A Linear Time Algorithm for Obtaining the Convex Hull of a Simple Polygon. Patt. Recogn., vol. 16, no. 6: 587–591
McCallum D, Avis D (1979) A Linear Algorithm for Finding the Convex Hull of a Simple Polygon. Inform. Proc. Lett., vol. 9, no. 5: 201–206
Sklansky J (1972) Measuring concavity on a rectangular mosaic. IEEE Trans. Comput. 21: 13551364
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Physica-Verlag Heidelberg
About this paper
Cite this paper
Hochstättler, W., Kromberg, S., Moll, C. (1994). A New Linear Time Algorithm for Computing the Convex Hull of a Simple Polygon. In: Bachem, A., Derigs, U., Jünger, M., Schrader, R. (eds) Operations Research ’93. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-46955-8_61
Download citation
DOI: https://doi.org/10.1007/978-3-642-46955-8_61
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0794-3
Online ISBN: 978-3-642-46955-8
eBook Packages: Springer Book Archive