ellipsoid_tree 0.1.0
Exact intersection tests for ellipsoids and friends
Loading...
Searching...
No Matches
ellipsoid_tree::BoxClosestPointOptions Struct Reference

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.
 

Detailed Description

Options controlling the iterative (M-metric) closest_point_in_box solve.

Member Data Documentation

◆ tol

double ellipsoid_tree::BoxClosestPointOptions::tol = 1.0e-12

convergence: max coordinate step, relative to box size

◆ max_sweeps

int ellipsoid_tree::BoxClosestPointOptions::max_sweeps = 256

Maximum number of coordinate-descent sweeps.

◆ stop_below

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.


The documentation for this struct was generated from the following file: