\( \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 4.11 - dD Spatial Searching
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
CGAL::Kd_tree< Traits, Splitter, UseExtendedNode > Member List

This is the complete list of members for CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >, including all inherited members.

begin() const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
bounding_box() const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
build()CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
capacity()CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
clear()CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
D typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
end() const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
FT typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
insert(Point_d p)CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
insert(InputIterator first, InputIterator beyond)CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
invalidate_build()CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
iterator typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Kd_tree(Splitter s=Splitter(), Traits t=Traits())CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Kd_tree(InputIterator first, InputIterator beyond, Splitter s=Splitter(), Traits t=Traits())CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Node_const_handle typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Node_handle typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Point_d typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Point_d_iterator typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
remove(Point_d p, Identify_point equal_to_p)CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
remove(Point_d p)CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
reserve(size_t size)CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
root()CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
root() const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
search(OutputIterator it, FuzzyQueryItem q) const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
search_any_point(FuzzyQueryItem q) const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
size() const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
size_type typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
Splitter typedefCGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
statistics(std::ostream &s) const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >
traits() const CGAL::Kd_tree< Traits, Splitter, UseExtendedNode >