Hello,

I have a polygon and like to find the pair of points defining the largest distance (also known as diameter problem).

the question is also formulated here:
http://stackoverflow.com/questions/6524350/algorithm-to-find-points-that-are-furthest-apart-better-than-on2

is there a boost::geometry implementation? something like
bg::diameter(bg::model::polygon<>)