An algorithm for maximum inscribed circle based on Voronoi diagrams and geometrical properties

摘要

The aim of this study is to formulate an algorithm for the calculation of maximum inscribed circle (MIC) that can be placed within a polygon and to implement it by using free and open source software (FOSS) for GIS. MIC is used in a wide range of fields, ranging from cartography, planning, agriculture, forestry and geology to medicine, biology, astronomy, security, and engineering applications. Due to the complexity of the problem, there is no single and simple algorithm for the computation of MIC for arbitrary polygons. The algorithm developed in this study (MICGIS) for the computation of MIC can be applied to both convex and concave polygons represented in vector data format. MICGIS makes use of the Voronoi diagrams and geometrical properties by benefiting from the solutions proposed for the special cases of Apollonius' Problem. Thanks to the employment of Voronoi diagrams and FOSS for GIS, MICGIS also works successfully for polygons with holes. For the implementation of MICGIS, FOSS libraries written in Java are used. What is evident from the various runs of the script produced on the base of MICGIS for a set of arbitrary polygons is that it is both faster and more accurate in finding MIC compared with the alternative algorithms and software.