![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/7/71/GrahamScanDemo.gif/640px-GrahamScanDemo.gif&w=640&q=50)
Graham scan
Algorithm for computing convex hulls in a set of points / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Graham scan?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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.[1] The algorithm finds all vertices of the convex hull ordered along its boundary. It uses a stack to detect and remove concavities in the boundary efficiently.
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/7/71/GrahamScanDemo.gif/320px-GrahamScanDemo.gif)