2-dimensional Convex Hull: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:1911:19, 15 February 2023‎ Admin talk contribs‎ 1,252 bytes +1,252‎ Created page with "{{DISPLAYTITLE:2-dimensional Convex Hull (Convex Hull)}} == Description == The convex hull or convex envelope or convex closure of a set X of points in the Euclidean plane or in a Euclidean space (or; more generally; in an affine space over the reals) is the smallest convex set that contains X. Here, we are looking at the 2-dimensional case. == Related Problems == Generalizations: d-dimensional Convex Hull Subproblem: 2-dimensional Convex Hull, Online, 2..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/2-dimensional_Convex_Hull"