From d2ffed2774ae995033f37a3d86d3bceee78c5cc0 Mon Sep 17 00:00:00 2001
From: Andreas Fabri <Andreas.Fabri@geometryfactory.com>
Date: Tue, 16 Sep 2003 14:20:31 +0000
Subject: [PATCH] REmoved Kd tree

---
 .../doc_tex/SearchStructures_ref/intro.tex          | 13 ++++---------
 .../doc_tex/basic/SearchStructures_ref/intro.tex    | 13 ++++---------
 2 files changed, 8 insertions(+), 18 deletions(-)

diff --git a/Packages/SearchStructures/doc_tex/SearchStructures_ref/intro.tex b/Packages/SearchStructures/doc_tex/SearchStructures_ref/intro.tex
index a4e1d456d7e..66fe545730b 100644
--- a/Packages/SearchStructures/doc_tex/SearchStructures_ref/intro.tex
+++ b/Packages/SearchStructures/doc_tex/SearchStructures_ref/intro.tex
@@ -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>}\\
diff --git a/Packages/SearchStructures/doc_tex/basic/SearchStructures_ref/intro.tex b/Packages/SearchStructures/doc_tex/basic/SearchStructures_ref/intro.tex
index a4e1d456d7e..66fe545730b 100644
--- a/Packages/SearchStructures/doc_tex/basic/SearchStructures_ref/intro.tex
+++ b/Packages/SearchStructures/doc_tex/basic/SearchStructures_ref/intro.tex
@@ -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>}\\