songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

REmoved Kd tree

This commit is contained in:
Andreas Fabri 2003-09-16 14:20:31 +00:00
parent af0106ebc2
commit d2ffed2774
2 changed files with 8 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
Packages/SearchStructures/doc_tex/SearchStructures_ref/intro.tex
View File

@ -1,7 +1,8 @@
\chapter{dD Search Structures}
\chapter{dD Range and Segment Tree}
This chapter presents the {\cgal} range tree and segment tree data structures.
This chapter presents the {\cgal} range tree, segment tree, and $Kd$-tree
data structures.
The range tree is theoretically superior to the $Kd$-tree, but the
latter often seems to perform better.
However, the range tree as implemented in {\cgal} is more flexible than the
@ -10,15 +11,11 @@ and segment trees in the same data structure.
\ccHeading{Concepts}
\ccRefConceptPage{KdtreeDTraits} \\
\ccRefConceptPage{RangeSegmentTreeTraits_k} \\
\ccRefConceptPage{Sublayer} \\
\ccHeading{Traits Classes}
\ccRefIdfierPage{CGAL::Kdtree_Interface<Point>} \\
\ccRefIdfierPage{CGAL::Kdtree_Interface_2d<Point>}\\
\ccRefIdfierPage{CGAL::Kdtree_Interface_3d<Point>}\\
\ccRefIdfierPage{CGAL::Range_segment_tree_traits_set_2<R>} \\
\ccRefIdfierPage{CGAL::Range_segment_tree_traits_set_3<R>} \\
\ccRefIdfierPage{CGAL::Range_tree_traits_map_2<R,T>} \\
@ -31,8 +28,6 @@ and segment trees in the same data structure.
\ccHeading{Search Structure Classes}
\ccRefIdfierPage{CGAL::Kdtree_d<Traits>}\\
\ccRefIdfierPage{CGAL::Kdtree_d<Traits>::Box}\\
\ccRefIdfierPage{CGAL::Range_tree_d<Data, Window, Traits>}\\
\ccRefIdfierPage{CGAL::Range_tree_k<Traits>}\\
\ccRefIdfierPage{CGAL::Segment_tree_d<Data, Window, Traits>}\\

13
Packages/SearchStructures/doc_tex/basic/SearchStructures_ref/intro.tex
View File

@ -1,7 +1,8 @@
\chapter{dD Search Structures}
\chapter{dD Range and Segment Tree}
This chapter presents the {\cgal} range tree and segment tree data structures.
This chapter presents the {\cgal} range tree, segment tree, and $Kd$-tree
data structures.
The range tree is theoretically superior to the $Kd$-tree, but the
latter often seems to perform better.
However, the range tree as implemented in {\cgal} is more flexible than the
@ -10,15 +11,11 @@ and segment trees in the same data structure.
\ccHeading{Concepts}
\ccRefConceptPage{KdtreeDTraits} \\
\ccRefConceptPage{RangeSegmentTreeTraits_k} \\
\ccRefConceptPage{Sublayer} \\
\ccHeading{Traits Classes}
\ccRefIdfierPage{CGAL::Kdtree_Interface<Point>} \\
\ccRefIdfierPage{CGAL::Kdtree_Interface_2d<Point>}\\
\ccRefIdfierPage{CGAL::Kdtree_Interface_3d<Point>}\\
\ccRefIdfierPage{CGAL::Range_segment_tree_traits_set_2<R>} \\
\ccRefIdfierPage{CGAL::Range_segment_tree_traits_set_3<R>} \\
\ccRefIdfierPage{CGAL::Range_tree_traits_map_2<R,T>} \\
@ -31,8 +28,6 @@ and segment trees in the same data structure.
\ccHeading{Search Structure Classes}
\ccRefIdfierPage{CGAL::Kdtree_d<Traits>}\\
\ccRefIdfierPage{CGAL::Kdtree_d<Traits>::Box}\\
\ccRefIdfierPage{CGAL::Range_tree_d<Data, Window, Traits>}\\
\ccRefIdfierPage{CGAL::Range_tree_k<Traits>}\\
\ccRefIdfierPage{CGAL::Segment_tree_d<Data, Window, Traits>}\\