Hi !

I use boost geometry to draw polygons with feathering. I need to compute distance from many points to the different polygons rings (outer and inners).

To compute the distance from a point to a ring, I iterate over the ring segments and use boost::geometry::comparable_distance from point to segment.

To optimize it I was looking at the R-Tree. Is that an option ? Would it help getting the minimum distance from a point to a ring ? With an R-Tree containing all ring segments ?

Any link is much appreciated !

Thanks !

Best Regards,

Matthieu B.