|
ellipsoid_tree 0.1.0
Exact intersection tests for ellipsoids and friends
|
Options controlling the iterative (M-metric) closest_point_in_box solve. More...
#include <ellipsoid_tree/intersections.hpp>
Public Attributes | |
| double | tol = 1.0e-12 |
| convergence: max coordinate step, relative to box size | |
| int | max_sweeps = 256 |
| Maximum number of coordinate-descent sweeps. | |
| double | stop_below = -std::numeric_limits<double>::infinity() |
| Early exit: return once distance_squared <= stop_below. | |
Options controlling the iterative (M-metric) closest_point_in_box solve.
| double ellipsoid_tree::BoxClosestPointOptions::tol = 1.0e-12 |
convergence: max coordinate step, relative to box size
| int ellipsoid_tree::BoxClosestPointOptions::max_sweeps = 256 |
Maximum number of coordinate-descent sweeps.
| double ellipsoid_tree::BoxClosestPointOptions::stop_below = -std::numeric_limits<double>::infinity() |
Early exit: return once distance_squared <= stop_below.
The reported distance is always an achieved (upper-bound) value, so early "close enough" verdicts are certificates.