Computing Convex Hulls
<p>Imagine that you have a bunch of points in the 2-dimensional plane.</p>
<p><img alt="" src="https://miro.medium.com/v2/resize:fit:576/1*OzZCwTJZHhzHE5Ss7qLZCQ.png" style="height:408px; width:576px" /></p>
<p>Image by the author.</p>
<p>A <strong>convex hull</strong> is a simple geometric shape that represents or summarizes such point clouds. Speaking in mathematic language, it is the smallest convex subset that contains all the given points. In layman’s terms, you put a rubber band around some tacks in a wall and then release it:</p>
<p><a href="https://allaboutalgorithms.com/computing-convex-hulls-b08c9c48ab5a"><strong>Click Here</strong></a></p>