AABBtree  0.0.0
A C++ non-recursive ND AABB tree
Loading...
Searching...
No Matches
AABBtree::Box< Real, N > Member List

This is the complete list of members for AABBtree::Box< Real, N >, including all inherited members.

baricenter() constAABBtree::Box< Real, N >inline
baricenter(Integer i) constAABBtree::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 typedefAABBtree::Box< Real, N >private
BoxUniquePtrList typedefAABBtree::Box< Real, N >private
cast() constAABBtree::Box< Real, N >inline
contains(Point const &p) constAABBtree::Box< Real, N >inline
contains(Box const &b) constAABBtree::Box< Real, N >inline
diagonal() constAABBtree::Box< Real, N >inline
DUMMY_TOLAABBtree::Box< Real, N >privatestatic
EPSAABBtree::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) constAABBtree::Box< Real, N >inline
exterior_distance(Point const &p, Point &f) constAABBtree::Box< Real, N >inline
exterior_distance(Box const &b) constAABBtree::Box< Real, N >inline
exterior_distance(Box const &b, Point &p1, Point &p2) constAABBtree::Box< Real, N >inline
exterior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
exterior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
INFAABBtree::Box< Real, N >privatestatic
interior_distance(Point const &p) constAABBtree::Box< Real, N >inline
interior_distance(Point const &p, Point &c) constAABBtree::Box< Real, N >inline
interior_distance(Box const &b) constAABBtree::Box< Real, N >inline
interior_distance(Box const &b, Point &p1, Point &p2) constAABBtree::Box< Real, N >inline
interior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
interior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
intersect(Box const &b_in, Box &b_out) constAABBtree::Box< Real, N >inline
intersect(Ray< Real, N > const &r, Point &c, Point &f, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
intersects(Box const &b) constAABBtree::Box< Real, N >inline
intersects(Point const &p) constAABBtree::Box< Real, N >inline
intersects(Ray< Real, N > const &r, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
is_approx(Box const &b, Real const tol) constAABBtree::Box< Real, N >inline
is_degenerate(Real const tol) constAABBtree::Box< Real, N >inline
is_empty() constAABBtree::Box< Real, N >inline
longest_axis() constAABBtree::Box< Real, N >inline
longest_axis(Real &max_length, Real &mid_point) constAABBtree::Box< Real, N >inline
m_maxAABBtree::Box< Real, N >private
m_minAABBtree::Box< Real, N >private
max() constAABBtree::Box< Real, N >inline
max()AABBtree::Box< Real, N >inline
merged(Box const &b) constAABBtree::Box< Real, N >inline
min() constAABBtree::Box< Real, N >inline
min()AABBtree::Box< Real, N >inline
operator=(Box const &b)=defaultAABBtree::Box< Real, N >
Point typedefAABBtree::Box< Real, N >private
print(std::ostream &os) constAABBtree::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 nameAABBtree::Box< Real, N >
sort_axes_length(Vector &sizes, Eigen::Vector< Integer, N > &ipos) constAABBtree::Box< Real, N >inline
squared_exterior_distance(Point const &p) constAABBtree::Box< Real, N >inline
squared_exterior_distance(Point const &p, Point &f) constAABBtree::Box< Real, N >inline
squared_exterior_distance(Box const &b) constAABBtree::Box< Real, N >inline
squared_exterior_distance(Box const &b, Point &p1, Point &p2) constAABBtree::Box< Real, N >inline
squared_exterior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
squared_exterior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
squared_interior_distance(Point const &p) constAABBtree::Box< Real, N >inline
squared_interior_distance(Point const &p, Point &c) constAABBtree::Box< Real, N >inline
squared_interior_distance(Box const &b) constAABBtree::Box< Real, N >inline
squared_interior_distance(Box const &b, Point &p1, Point &p2) constAABBtree::Box< Real, N >inline
squared_interior_distance(Ray< Real, N > const &r, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
squared_interior_distance(Ray< Real, N > const &r, Point &p1, Point &p2, Real tol=DUMMY_TOL) constAABBtree::Box< Real, N >inline
surface() constAABBtree::Box< Real, N >inline
transform(Transform const &t)AABBtree::Box< Real, N >inline
transformed(Transform const &t) constAABBtree::Box< Real, N >inline
translate(Vector const &t)AABBtree::Box< Real, N >inline
translated(Vector const &t) constAABBtree::Box< Real, N >inline
Vector typedefAABBtree::Box< Real, N >private
volume() constAABBtree::Box< Real, N >inline
which_side(Real const x, Real const tol, Integer const dim) constAABBtree::Box< Real, N >inline
~Box()=defaultAABBtree::Box< Real, N >