A grid is laid over the polygo, the internal points are extracted and for each one the shortest distance to te perimeter is determined. Then the point with the largest distance is returned.
X=list()X$x=c(11.991,11.942,11.891,11.834,11.775,11.725,11.691,11.712,11.746,11.804,11.865,11.957,11.991)X$y=c(-2.0091,-2.0699,-2.0823,-2.1091,-2.1419,-2.1394,-2.1165,-2.0604,-2.0196,-1.9847,-1.9668,-1.9777,-2.0091)polyintern(X, n =10, PLOT=TRUE)