The Graham scan cardGraham scan

Graham scan

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

Graham's scan is a method of finding the convex hull of a finite set of points in the plane with time complexity O(n log n). It is named after Ronald Graham, who published the original algorithm in 1972. The algorithm finds all vertices of the convex hull ordered along its boundary.

Excerpt from the Wikipedia article “Graham scan”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: Fschwarzentruber, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Graham scan to your collection.

Play for free

Related cards