Thanks to all.
This was the request in my thread
here:
I try to explain how it works:
(grid_1)
Calculation of the grid points within the getboundingbox of poly,
Subdivision = (step1 x step1)
Increase the value of step1 for greater certainty of outcome
I think step1 =
60 a good relationship time/accuracy
(Point_int)
Calculation of internal points on the polyline
(grid+)
Increase the density of the grid points (only internal).
(Point_center)
Calculation of the farthest point from the polyline
(grid_2)
Calculation of a new (dense) grid of points around the center provisionally calculated
The result is approximated.
Perhaps for the exact solution:
1.Construct the Voronoi Diagram of the edges in P. This can be done with, for example, Fortunes algorithm;
2.For Voronoi nodes (points equidistant to three or more edges) inside P;
3.Find the node with the maximum distance to edges in P. This node is the centre of the maximum inscribed circle.http://stackoverflow.com/questions/4279478/maximum-circle-inside-a-non-convex-polygonVoronoi DiagramFortunes algorithmCiao