Abstract
The problem of computing a convex hull is not only central to practical applications, but is also a vehicle for the solution of a number of apparently unrelated questions arising in computational geometry. The computation of the convex hull of a finite set of points, particularly in the plane, has been studied extensively and has applications, for example, in pattern recognition [Akl–CToussaint (1978); Duda–CHart (1973)], image processing [Rosenfeld (1969)] and stock cutting and allocation [Freeman (1974);Sklansky (1972); Freeman–CShapira (1975)].
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer Science+Business Media New York
About this chapter
Cite this chapter
Preparata, F.P., Shamos, M.I. (1985). Convex Hulls: Basic Algorithms. In: Computational Geometry. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1098-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1098-6_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7010-2
Online ISBN: 978-1-4612-1098-6
eBook Packages: Springer Book Archive