Graham scan
algorithm for finding the convex hull of a set of points in the plane
Press Enter · cited answer in seconds
0 sources
Graham scan
Summary
Graham scan is a convex hull algorithm[1]. It draws 85 Wikipedia views per month (convex_hull_algorithm category, ranking #1 of 5).[2]
Key Facts
- Graham scan's instance of is recorded as convex hull algorithm[3].
- Ronald Graham is named after Graham scan[4].
- Graham scan's Freebase ID is recorded as /m/022_1b[5].
- Graham scan's worst-case time complexity is recorded as O(n \log n)[6].
- Graham scan's Microsoft Academic ID is recorded as 2780353867[7].
- Graham scan's GitHub topic is recorded as graham-scan-algorithm[8].
- Graham scan's GitHub topic is recorded as graham-scan[9].
Body
Designation and Status
Graham scan's instance of is recorded as convex hull algorithm[3].
History and Context
Ronald Graham is named after Graham scan[4].
Why It Matters
Graham scan draws 85 Wikipedia views per month (convex_hull_algorithm category, ranking #1 of 5).[2] It has Wikipedia articles in 14 language editions, a strong signal of global cultural recognition.[10] It is known by 4 alternative names across languages and contexts.[11]