20 Apr
2016
20 Apr
'16
8:40 a.m.
Hello, Let's assume I have an image with 0's as background B and a connected set S made of 1. Is there an easy way with scikit-image to find the maximum (in terms of area) subset of S that is convex. This question is also described here: - http://math.stackexchange.com/questions/455687/find-the-maximum-convex-area - http://stackoverflow.com/questions/17943482/find-the-maximum-convex-area/179... I was wondering if there was an algorithm already implemented in the library to easily do that. Otherwise I guess I'll have to implement it by myself as described in the links above. Many thanks,