Geodetic bounding circle algorithm

Open dsmiley opened this issue 12 years ago • 2 comments

Given a set of points on the surface of a sphere, what is the centroid and smallest radius that encompasses them? Answering this is useful for getting a circle approximation of a shape, useful potentially for subsequently computing shape overlap similarity (relevancy/ranking metric). And it could be used to compute a polygon center, which then might be used to locally-project the data to then do other things.

For inspiration, we could examine JTS's Euclidean algorithm, and adapt it to work geodetically. I worked a concept of this out on paper.

Nov 20 '13 21:11 dsmiley

Might like to work on this - looking into it

Jan 17 '14 05:01 rfalford12

I will work on this task.

Jan 20 '14 21:01 rfalford12