In computational geometry, convex hull is the boundary of minimal convex set containing a given finite set of points in a plane. Otherwise, it is a simple closed polygonal chain encompassing all the points. As an example it looks like the following. In a recent Proof of Concept at the Microsoft Technology Centre, we needed to build such a polygon. Dealing with around 40 million points with each Point ...
[Read more]