mirror of
https://github.com/boostorg/geometry.git
synced 2026-02-10 23:42:12 +00:00
add generic algorithm for computing segment-to-box distances: the algorithm first checks the segment and the box for intersection, then if no intersection is found, it returns the minimum distance over all point-segment combinations from the two geometries; for computing a point-box distance the algorithm either calls the default point-box strategy, or calls the detail::distance::point_to_range algorithm; this alternate segment-box distance computation algorithm is currently used in unit tests of segment-box distances to verify results with the cartesian-specific approach