Graham scan
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. It uses a stack to detect and remove concavities in the boundary efficiently.
known for
Wikipage redirect
All nearest smaller valuesCC systemChan's algorithmConvex hullConvex hull algorithmsConvex hull of a simple polygonGift wrapping algorithmGrahamGraham's algorithmGraham's scanGraham ScanList of algorithmsList of convexity topicsList of geometry topicsOutput-sensitive algorithmRonald GrahamSMAWK algorithmScanStack (abstract data type)Timeline of algorithms
Link from a Wikipage to another Wikipage
primaryTopic
Graham scan
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. It uses a stack to detect and remove concavities in the boundary efficiently.
has abstract
Algorytm Grahama – efektywny a ......
*
*
*
*
*
*
*
*
*
*
@pl
Der Graham Scan (nach Ronald G ...... ne asymptotische Laufzeit in .
@de
El mètode de Graham (Graham sc ...... ertanyen a aquesta envolupant.
@ca
El método de Graham (Graham sc ...... pertenecen a dicha envolvente.
@es
En informatique, et en géométr ...... l'algorithme original en 1972.
@fr
Graham's scan is a method of f ...... s in the boundary efficiently.
@en
O Exame de Graham, cuja denomi ...... mplexidade de tempo (n log n).
@pt
Алгоритм Грехема (англ. Graham ...... и впорядковані вздовж її межі.
@uk
Алгоритм Грэхема — алгоритм по ...... обхода против часовой стрелки.
@ru
葛立恒扫描法（Graham's scan）是一种计算一组的平面点的凸包的算法，时间复杂度为。以在1972年发表该算法的葛立恒命名。
@zh
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,021,817,950
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Algorytm Grahama – efektywny a ......
*
*
*
*
*
*
*
*
*
*
@pl
Der Graham Scan (nach Ronald G ...... ne asymptotische Laufzeit in .
@de
El mètode de Graham (Graham sc ...... ertanyen a aquesta envolupant.
@ca
El método de Graham (Graham sc ...... pertenecen a dicha envolvente.
@es
En informatique, et en géométr ...... l'algorithme original en 1972.
@fr
Graham's scan is a method of f ...... s in the boundary efficiently.
@en
O Exame de Graham, cuja denomi ...... mplexidade de tempo (n log n).
@pt
Алгоритм Грехема (англ. Graham ...... и впорядковані вздовж її межі.
@uk
Алгоритм Грэхема — алгоритм по ...... обхода против часовой стрелки.
@ru
葛立恒扫描法（Graham's scan）是一种计算一组的平面点的凸包的算法，时间复杂度为。以在1972年发表该算法的葛立恒命名。
@zh
label
Algorytm Grahama
@pl
Exame de Graham
@pt
Graham Scan
@de
Graham scan
@en
Mètode de Graham
@ca
Método de Graham
@es
Parcours de Graham
@fr
Алгоритм Грехема
@uk
Алгоритм Грэхема
@ru
葛立恆掃描法
@zh