baricenter() const | AABBtree::Box< Real, N > | inline |
baricenter(Integer i) const | AABBtree::Box< Real, N > | inline |
Box() | AABBtree::Box< Real, N > | inline |
Box(Box const &b) | AABBtree::Box< Real, N > | inline |
Box(Point const &t_min, Point const &t_max) | AABBtree::Box< Real, N > | inline |
Box(Point const &p) | AABBtree::Box< Real, N > | inline |
Box(Real const x_min, Real const x_max) | AABBtree::Box< Real, N > | inline |
Box(Real const x_min, Real const y_min, Real const x_max, Real const y_max) | AABBtree::Box< Real, N > | inline |
Box(Real const x_min, Real const y_min, Real const z_min, Real const x_max, Real const y_max, Real const z_max) | AABBtree::Box< Real, N > | inline |
Box(Box< OtherReal, N > const &b) | AABBtree::Box< Real, N > | inlineexplicit |
BoxUniquePtr typedef | AABBtree::Box< Real, N > | private |
BoxUniquePtrList typedef | AABBtree::Box< Real, N > | private |
cast() const | AABBtree::Box< Real, N > | inline |
contains(Point const &p) const | AABBtree::Box< Real, N > | inline |
contains(Box const &b) const | AABBtree::Box< Real, N > | inline |
diagonal() const | AABBtree::Box< Real, N > | inline |
DUMMY_TOL | AABBtree::Box< Real, N > | privatestatic |
EPS | AABBtree::Box< Real, N > | privatestatic |
extend(Point const &p) | AABBtree::Box< Real, N > | inline |
extend(Box const &b) | AABBtree::Box< Real, N > | inline |
exterior_distance(Point const &p) const | AABBtree::Box< Real, N > | inline |
exterior_distance(Point const &p, Point &f) const | AABBtree::Box< Real, N > | inline |
exterior_distance(Box const &b) const | AABBtree::Box< Real, N > | inline |
exterior_distance(Box const &b, Point &p1, Point &p2) const | AABBtree::Box< Real, N > | inline |
exterior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
exterior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
INF | AABBtree::Box< Real, N > | privatestatic |
interior_distance(Point const &p) const | AABBtree::Box< Real, N > | inline |
interior_distance(Point const &p, Point &c) const | AABBtree::Box< Real, N > | inline |
interior_distance(Box const &b) const | AABBtree::Box< Real, N > | inline |
interior_distance(Box const &b, Point &p1, Point &p2) const | AABBtree::Box< Real, N > | inline |
interior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
interior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
intersect(Box const &b_in, Box &b_out) const | AABBtree::Box< Real, N > | inline |
intersect(Ray< Real, N > const &r, Point &c, Point &f, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
intersects(Box const &b) const | AABBtree::Box< Real, N > | inline |
intersects(Point const &p) const | AABBtree::Box< Real, N > | inline |
intersects(Ray< Real, N > const &r, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
is_approx(Box const &b, Real const tol) const | AABBtree::Box< Real, N > | inline |
is_degenerate(Real const tol) const | AABBtree::Box< Real, N > | inline |
is_empty() const | AABBtree::Box< Real, N > | inline |
longest_axis() const | AABBtree::Box< Real, N > | inline |
longest_axis(Real &max_length, Real &mid_point) const | AABBtree::Box< Real, N > | inline |
m_max | AABBtree::Box< Real, N > | private |
m_min | AABBtree::Box< Real, N > | private |
max() const | AABBtree::Box< Real, N > | inline |
max() | AABBtree::Box< Real, N > | inline |
merged(Box const &b) const | AABBtree::Box< Real, N > | inline |
min() const | AABBtree::Box< Real, N > | inline |
min() | AABBtree::Box< Real, N > | inline |
operator=(Box const &b)=default | AABBtree::Box< Real, N > | |
Point typedef | AABBtree::Box< Real, N > | private |
print(std::ostream &os) const | AABBtree::Box< Real, N > | inline |
reorder() | AABBtree::Box< Real, N > | inline |
set_degenerate(Point const &p) | AABBtree::Box< Real, N > | inline |
set_empty() | AABBtree::Box< Real, N > | inline |
Side enum name | AABBtree::Box< Real, N > | |
sort_axes_length(Vector &sizes, Eigen::Vector< Integer, N > &ipos) const | AABBtree::Box< Real, N > | inline |
squared_exterior_distance(Point const &p) const | AABBtree::Box< Real, N > | inline |
squared_exterior_distance(Point const &p, Point &f) const | AABBtree::Box< Real, N > | inline |
squared_exterior_distance(Box const &b) const | AABBtree::Box< Real, N > | inline |
squared_exterior_distance(Box const &b, Point &p1, Point &p2) const | AABBtree::Box< Real, N > | inline |
squared_exterior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
squared_exterior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
squared_interior_distance(Point const &p) const | AABBtree::Box< Real, N > | inline |
squared_interior_distance(Point const &p, Point &c) const | AABBtree::Box< Real, N > | inline |
squared_interior_distance(Box const &b) const | AABBtree::Box< Real, N > | inline |
squared_interior_distance(Box const &b, Point &p1, Point &p2) const | AABBtree::Box< Real, N > | inline |
squared_interior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
squared_interior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Box< Real, N > | inline |
surface() const | AABBtree::Box< Real, N > | inline |
transform(Transform const &t) | AABBtree::Box< Real, N > | inline |
transformed(Transform const &t) const | AABBtree::Box< Real, N > | inline |
translate(Vector const &t) | AABBtree::Box< Real, N > | inline |
translated(Vector const &t) const | AABBtree::Box< Real, N > | inline |
Vector typedef | AABBtree::Box< Real, N > | private |
volume() const | AABBtree::Box< Real, N > | inline |
which_side(Real const x, Real const tol, Integer const dim) const | AABBtree::Box< Real, N > | inline |
~Box()=default | AABBtree::Box< Real, N > | |