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 October 2022

    • curprev 11:5411:54, 10 October 2022‎ Admin talk contribs‎ 1,626 bytes +1,626‎ Created page with "== Problem Description== The Convex Hull is the line completely enclosing a set of points in a plane so that there are no concavities in the line. More formally, we can describe it as the smallest convex polygon which encloses a set of points such that each point in the set lies within the polygon or on its perimeter. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Convex_Hull"