[R-sig-Geo] Finding the Circumscribing Circle of a polygon

[Berry Boessenkool]

Hi Greg,

why did you add in particular
+ 10*sum(dists<0) 
in the function to be minimized?

If I understand this correctly, this is the "punishment" of points outside
the current circle.
But if the points are very far apart (distances are large), then wouldn't
optim focus more on that part of the sum, instead of the number of points
outside as above?
Shouldn't the factor 10 be relative to the distance units?
Or is there a way to have optim only look at circles enclosing all vertices
of the convex hull?

I was thinking there must be an analytical solution, but apparently not:
http://en.wikipedia.org/wiki/Smallest_circle_problem

Berry




--
View this message in context: http://r-sig-geo.2731867.n2.nabble.com/Finding-the-Circumscribing-Circle-of-a-polygon-tp7582372p7582388.html
Sent from the R-sig-geo mailing list archive at Nabble.com.