A gentle introduction to the convex hull problem

<p>Convex hulls tend to be useful in many different fields, sometimes quite unexpectedly. In this article, I&rsquo;ll explain the basic Idea of 2d convex hulls and how to use the graham scan to find them. So if you already know about the graham scan, then this article is not for you, but if not, this should familiarise you with some of the relevant concepts.</p> <h1>What is the convex hull?</h1> <p>The convex hull of a set of points is defined as the smallest convex polygon, that encloses all of the points in the set. Convex means that the polygon has no corner that is bent inwards.</p> <p><a href="https://medium.com/@pascal.sommer.ch/a-gentle-introduction-to-the-convex-hull-problem-62dfcabee90c"><strong>Visit Now</strong></a></p>
Tags: Convex hull