Graham scan
algorithm for finding the convex hull of a set of points in the plane
Facts
4 properties- Instance of
- convex hull algorithm
- Named after
- Ronald Graham[2]
- Worst case time complexity
- O(n \log n)
- Worst-case time complexity
- O(n \log n)[3]
🏷️ Also known as
en Graham scan
en Graham's scan
es Metodo de Graham
es Método de Graham
fa پیمایش گراهام
fi Grahamin algoritmi
fi Grahamin pyyhkäisymenetelmä
fr Parcours de Graham
he הסריקה של גראהם
hu Graham-pásztázás
ja グラハムスキャン
ja グラハム探索
ko 그레이엄 스캔
pl algorytm Grahama
pt Exame de Graham
ro algoritmul Graham
ru Алгоритм Грэхема
th เกรแฮมสแกน
uk Алгоритм Грехема
🔖 Identifiers · 3
- Freebase ID
- /m/022_1b
- GitHub topic
- graham-scan-algorithm, graham-scan
- Microsoft Academic ID (discontinued)
- 2780353867
🔗 Connections
Instance of 1
Named after 1
← Based on 1
← FactGrid item ID 1
Press Enter · cited answer in seconds
0 sources
Summary
Graham scan is a convex hull algorithm[1].