23 std::tuple<size_t, size_t, size_t>&
t 33 std::tuple<Geometry::Vec3, Geometry::Vec3>&
t 43 std::tuple<std::tuple<Geometry::Vec3, Geometry::Vec3>,
44 std::tuple<Geometry::Vec3, Geometry::Vec3>>&
t void sortVec3Tuple(std::tuple< Geometry::Vec3, Geometry::Vec3 > &t)
TODO.
Definition: Sort.cpp:35
void sortVec3TupleTuple(std::tuple< std::tuple< Geometry::Vec3, Geometry::Vec3 >, std::tuple< Geometry::Vec3, Geometry::Vec3 > > &t)
Definition: Sort.cpp:50
float t(const Plane &p, const Geometry::Vec3 &p1, const Geometry::Vec3 &p2)
Compute the t value for a plane and two points that form a line.
Definition: Intersection.cpp:30
void sortSizeTTuple(std::tuple< size_t, size_t, size_t > &t)
TODO.
Definition: Sort.cpp:24