Back Mètode de Graham Catalan Graham Scan German Método de Graham Spanish پیمایش گراهام Persian Parcours de Graham French הסריקה של גראהם HE 그레이엄 스캔 Korean Algorytm Grahama Polish Varredura de Graham Portuguese Algoritmul Graham Romanian
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.
- ^ Graham, R.L. (1972). "An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set" (PDF). Information Processing Letters. 1 (4): 132–133. doi:10.1016/0020-0190(72)90045-2.