In this article, we present an algorithm to compute the convex hull of a binary shape. Efficient algorithms to compute the convex hull of a set of points had been proposed long time ago. For a binary shape, the common practice is to rely on one of them: to compute the convex hull of binary shape, all pixels of the shape are first listed, and then the convex hull is computed on this list of points. The computed convex hull is finally rasterized to provide the final result [as, for example, in the famous scikit-image library (scikit-image: Image processing in python.
https://scikit-image.org
)]. To compute the convex hull of an arbitrary set of points, the points of the list that lie on the outline of the convex hull must be selected (to simplify, we call these points “
extrema
”). To find them, for an arbitrary set of points, it is necessary to browse all the points but not in the particular case of a binary shape. In th...

How to compute the convex hull of a binary shape? A real-time algorithm to compute the convex hull of a binary shape

10.1007/s11554-023-01359-8