 |
AABBtree
0.0.0
A C++ non-recursive ND AABB tree
|
|
AABBtree
0.0.0
A C++ non-recursive ND AABB tree
|
This is the complete list of members for AABBtree::Ray< Real, N >, including all inherited members.
| cast() const | AABBtree::Ray< Real, N > | inline |
| contains(Point const &p, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| direction() | AABBtree::Ray< Real, N > | inline |
| direction() const | AABBtree::Ray< Real, N > | inline |
| distance(Point const &p, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| distance(Point const &p, Point &c, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| DUMMY_TOL | AABBtree::Ray< Real, N > | privatestatic |
| EPS | AABBtree::Ray< Real, N > | privatestatic |
| exterior_distance(Box< Real, N > const &b, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| exterior_distance(Box< Real, N > const &b, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| INF | AABBtree::Ray< Real, N > | privatestatic |
| interior_distance(Box< Real, N > const &b, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| interior_distance(Box< Real, N > const &b, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| intersect(Box< Real, N > const &b, Point &c, Point &f, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| intersects(Box< Real, N > const &b, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| is_approx(Ray const &r, Real const tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| m_direction | AABBtree::Ray< Real, N > | private |
| m_origin | AABBtree::Ray< Real, N > | private |
| normalize() | AABBtree::Ray< Real, N > | inline |
| normalized() const | AABBtree::Ray< Real, N > | inline |
| origin() | AABBtree::Ray< Real, N > | inline |
| origin() const | AABBtree::Ray< Real, N > | inline |
| Point typedef | AABBtree::Ray< Real, N > | private |
| print(std::ostream &os) const | AABBtree::Ray< Real, N > | inline |
| Ray()=default | AABBtree::Ray< Real, N > | |
| Ray(Ray const &r) | AABBtree::Ray< Real, N > | inline |
| Ray(Point const &o, Vector const &d) | AABBtree::Ray< Real, N > | inline |
| Ray(Real const o, Real const d) | AABBtree::Ray< Real, N > | inline |
| Ray(Real const o_x, Real const o_y, Real const d_x, Real const d_y) | AABBtree::Ray< Real, N > | inline |
| Ray(Real const o_x, Real const o_y, Real const o_z, Real const d_x, Real const d_y, Real const d_z) | AABBtree::Ray< Real, N > | inline |
| Ray(Ray< OtherReal, N > const &r) | AABBtree::Ray< Real, N > | inlineexplicit |
| squared_distance(Point const &p, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| squared_distance(Point const &p, Point &c, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| squared_exterior_distance(Box< Real, N > const &b, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| squared_exterior_distance(Box< Real, N > const &b, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| squared_interior_distance(Box< Real, N > const &b, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| squared_interior_distance(Box< Real, N > const &b, Point &p1, Point &p2, Real tol=DUMMY_TOL) const | AABBtree::Ray< Real, N > | inline |
| transform(Transform const &t) | AABBtree::Ray< Real, N > | inline |
| transformed(Transform const &t) const | AABBtree::Ray< Real, N > | inline |
| translate(Vector const &t) | AABBtree::Ray< Real, N > | inline |
| translated(Vector const &t) const | AABBtree::Ray< Real, N > | inline |
| Vector typedef | AABBtree::Ray< Real, N > | private |
| ~Ray()=default | AABBtree::Ray< Real, N > |
1.13.2