I would like to store 2D line segments and later find the line segment that is closest to a given point. I understand that the distance between the line segment and the point would be based on the bounding box of the segment and the distance to this bounding box. However, to organise the tree internally, I need a distance between segments. Is this possible with this library?
I would like to store 2D line segments and later find the line segment that is closest to a given point. I understand that the distance between the line segment and the point would be based on the bounding box of the segment and the distance to this bounding box. However, to organise the tree internally, I need a distance between segments. Is this possible with this library?