Romanian Algoritmul Graham Cited by user Turbojet on 13 May 2023 thumb|Demonstrație privind modul de acțiune al algoritmului pentru obținerea anvelopei convexe într-un spațiu bidimensional Algoritmul Graham este o metodă de a găsi…
English Graham scan Cited by user David Eppstein on 03 Aug 2022 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).
English Polygonalization Cited by user David Eppstein on 03 Aug 2022 In computational geometry, a polygonalization of a finite set of points in the Euclidean plane is a simple polygon with the given points as its vertices.