Skip to main content

Convex Hulls

  • Living reference work entry
  • First Online:
  • 546 Accesses

Years and Authors of Summarized Original Work

  • 1972; Graham

  • 1973; Jarvis

  • 1977; Preparata, Hong

  • 1996; Chan

Problem Definition

The convex hull of a set P of n points in \(\mathbb{R}^{d}\) is the intersection of all convex regions that contain P. While convex hulls are defined for arbitrary d, the focus here is on d = 2 (and d = 3). For a more general overview, we recommend reading [7, 9] as well as [3].

A frequently used visual description for a convex hull in 2D is a rubber band: when we imagine the points in the plane to be nails and put a rubber band around them, the convex hull is exactly the structure we obtain by a tight rubber band; see Fig. 1.

Fig. 1
figure 1

The convex hull of a set of points in \(\mathbb{R}^{2}\)

This is a preview of subscription content, log in via an institution.

Recommended Reading

  1. CGAL (2014) Computational geometry algorithms library. http://www.cgal.org

  2. Chan T (1996) Optimal output-sensitive convex hull algorithms in two and three dimensions. Discret Comput Geom 16(4):361–368. DOI10.1007/BF02712873

    Google Scholar 

  3. Devadoss SL, O’Rourke J (2011) Discrete and computational geometry. Princeton University Press, Princeton

    Google Scholar 

  4. Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Process Lett 1(4):132–133

    Article  MATH  Google Scholar 

  5. Jarvis R (1973) On the identification of the convex hull of a finite set of points in the plane. Information Process Lett 2(1):18–21. DOI10.1016/0020-0190(73)90020-3

    Google Scholar 

  6. Kettner L, Mehlhorn K, Pion S, Schirra S, Yap CK (2004) Classroom examples of robustness problems in geometric computations. In: Proceedings of the 12th annual European symposium on algorithms, vol 3221, pp 702–713

    Google Scholar 

  7. O’Rourke J (1998) Computational geometry in C, 2nd edn. Cambridge University Press, New York

    Book  MATH  Google Scholar 

  8. Preparata FP, Hong SJ (1977) Convex hulls of finite sets of points in two and three dimensions. Commun ACM 20(2):87–93

    Article  MathSciNet  MATH  Google Scholar 

  9. Sack JR, Urrutia J (eds) (2000) Handbook of computational geometry. North-Holland, Amsterdam

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael Hemmer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Hemmer, M., Schmidt, C. (2015). Convex Hulls. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_508-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_508-1

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics