An Efficient Algorithm to Calculate the Center of the Biggest Inscribed Circle in an Irregular Polygon
Metric Geometry
2012-12-14 v1 Data Structures and Algorithms
Abstract
In this paper, an efficient algorithm to find the center of the biggest circle inscribed in a given polygon is described. This work was inspired by the publication of Daniel Garcia-Castellanos & Umberto Lombardo and their algorithm used to find a landmass' poles of inaccessibility. Two more efficient algorithms were found, one of them only applicable when the problem can be described as a linear problem, like in the case of a convex polygon. Keywords: distance geometry, euclidean distance, inscribed circle, irregular polygon, algorithm, mathematical optimization, Monte Carlo, linear programming, maximin
Keywords
Cite
@article{arxiv.1212.3193,
title = {An Efficient Algorithm to Calculate the Center of the Biggest Inscribed Circle in an Irregular Polygon},
author = {Oscar Martinez},
journal= {arXiv preprint arXiv:1212.3193},
year = {2012}
}
Comments
10 pages, 11 figures