Computation of the minimum distance between non-convex polygons for segmentation quality evaluation
Oleh Berezsky, Oleh Pitsun · 2017 12th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT) · 2017
In this research study, the authors developed the algorithms for computing the minimum distances between non-convex polygons. The purpose of the study is to develop the algorithm that transforms non-convex polygons into multi-convex polygons and the algorithm that computes the minimum distances between polygons on the basis of Gromov-Hausdorff and Gromov-Fréchet metrics. The proposed algorithms have been used to quantify segmentation quality.