CGAL::AABB_tree< AABBTraits > Member List

This is the complete list of members for CGAL::AABB_tree< AABBTraits >, including all inherited members.

AABB_tree(const AABBTraits &traits=AABBTraits())	CGAL::AABB_tree< AABBTraits >
AABB_tree(Self &&) noexcept	CGAL::AABB_tree< AABBTraits >
AABB_tree(InputIterator first, InputIterator beyond, T &&...)	CGAL::AABB_tree< AABBTraits >
accelerate_distance_queries()	CGAL::AABB_tree< AABBTraits >
accelerate_distance_queries(ConstPointIterator first, ConstPointIterator beyond)	CGAL::AABB_tree< AABBTraits >
all_intersected_primitives(const Query &query, OutputIterator out) const	CGAL::AABB_tree< AABBTraits >
all_intersections(const Query &query, OutputIterator out) const	CGAL::AABB_tree< AABBTraits >
any_intersected_primitive(const Query &query) const	CGAL::AABB_tree< AABBTraits >
any_intersection(const Query &query) const	CGAL::AABB_tree< AABBTraits >
bbox() const	CGAL::AABB_tree< AABBTraits >
Bounding_box typedef	CGAL::AABB_tree< AABBTraits >
build(T &&...)	CGAL::AABB_tree< AABBTraits >
clear()	CGAL::AABB_tree< AABBTraits >
closest_point(const Point &query) const	CGAL::AABB_tree< AABBTraits >
closest_point(const Point &query, const Point &hint) const	CGAL::AABB_tree< AABBTraits >
closest_point_and_primitive(const Point &query) const	CGAL::AABB_tree< AABBTraits >
closest_point_and_primitive(const Point &query, const Point_and_primitive_id &hint) const	CGAL::AABB_tree< AABBTraits >
datum(Primitive &p) const	CGAL::AABB_tree< AABBTraits >
do_intersect(const Query &query) const	CGAL::AABB_tree< AABBTraits >
do_not_accelerate_distance_queries()	CGAL::AABB_tree< AABBTraits >
empty() const	CGAL::AABB_tree< AABBTraits >
first_intersected_primitive(const Ray &query, const SkipFunctor &skip) const	CGAL::AABB_tree< AABBTraits >
first_intersection(const Ray &query, const SkipFunctor &skip) const	CGAL::AABB_tree< AABBTraits >
FT typedef	CGAL::AABB_tree< AABBTraits >
insert(InputIterator first, InputIterator beyond, T &&...)	CGAL::AABB_tree< AABBTraits >
insert(const Primitive &p)	CGAL::AABB_tree< AABBTraits >
Intersection_and_primitive_id typedef	CGAL::AABB_tree< AABBTraits >
number_of_intersected_primitives(const Query &query) const	CGAL::AABB_tree< AABBTraits >
Object_and_primitive_id typedef	CGAL::AABB_tree< AABBTraits >
operator=(Self &&) noexcept	CGAL::AABB_tree< AABBTraits >
Point typedef	CGAL::AABB_tree< AABBTraits >
Point_and_primitive_id typedef	CGAL::AABB_tree< AABBTraits >
Primitive typedef	CGAL::AABB_tree< AABBTraits >
Primitive_id typedef	CGAL::AABB_tree< AABBTraits >
rebuild(ConstPrimitiveIterator first, ConstPrimitiveIterator beyond, T &&...)	CGAL::AABB_tree< AABBTraits >
size() const	CGAL::AABB_tree< AABBTraits >
size_type typedef	CGAL::AABB_tree< AABBTraits >
squared_distance(const Point &query) const	CGAL::AABB_tree< AABBTraits >
squared_distance(const Point &query, const Point &hint) const	CGAL::AABB_tree< AABBTraits >
traits() const	CGAL::AABB_tree< AABBTraits >
~AABB_tree()	CGAL::AABB_tree< AABBTraits >