Convex Hulls | SpringerLink
Skip to main content

Convex Hulls

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

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 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.

Convex Hulls, Fig. 1
figure 335 figure 335

The convex hull of a set of points in 2

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 142999
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
JPY 142999
Price includes VAT (Japan)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

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. doi:10.1007/BF02712873

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  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. doi:10.1016/0020-0190(73)90020-3

    Article  MathSciNet  MATH  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 authors

Correspondence to Michael Hemmer or Christiane Schmidt .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Hemmer, M., Schmidt, C. (2016). Convex Hulls. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_508

Download citation

Publish with us

Policies and ethics