\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 5.0 - K Discrete Oriented Polytope Tree (K-DOP Tree)
CGAL::KDOP_tree::KDOP_tree< KDOPTraits > Member List

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

all_intersected_primitives(const Query &query, OutputIterator out) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
all_intersections(const Query &query, OutputIterator out) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
any_intersected_primitive(const Query &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
any_intersection(const Query &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
build(T &&...)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
clear()CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
closest_point(const Point &query, const Point &hint) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
closest_point(const Point &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
closest_point_and_primitive(const Point &query, const Point_and_primitive_id &hint) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
closest_point_and_primitive(const Point &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
datum(Primitive &p) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Direction_type typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
do_intersect(const Query &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
empty() const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
first_intersected_primitive(const Ray &query, const SkipFunctor &skip) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
first_intersection(const Ray &query, const SkipFunctor &skip) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
FT typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
insert(InputIterator first, InputIterator beyond, T &&...)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
insert(const Primitive &p)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Intersection_and_primitive_id typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Kdop typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
kdop() const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
kdop_heights(std::vector< typename Kdop::Array_height > &heights)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
KDOP_tree(const KDOPTraits &traits=KDOPTraits())CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
KDOP_tree(InputIterator first, InputIterator beyond, T &&...)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
number_of_intersected_primitives(const Query &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Point typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Point_and_primitive_id typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Primitive typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
Primitive_id typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
rebuild(ConstPrimitiveIterator first, ConstPrimitiveIterator beyond, T &&...)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
set_kdop_directions(const std::vector< Direction_type > &directions)CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
size() const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
size_type typedefCGAL::KDOP_tree::KDOP_tree< KDOPTraits >
squared_distance(const Point &query, const Point &hint) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
squared_distance(const Point &query) const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
traits() const CGAL::KDOP_tree::KDOP_tree< KDOPTraits >
~KDOP_tree()CGAL::KDOP_tree::KDOP_tree< KDOPTraits >