Is there something tricky about that? Or I should use some of the standard convex hull algorithms ?
I mean, I don't see anything different between creating convex hull for a set of points and creating convex hull for non-overlapping convex polygons (2D)?
Convex hull for convex polygons
3
$\begingroup$
algorithms
computational-geometry