diff --git a/Packages/SearchStructures/doc_tex/SearchStructures/main.tex b/Packages/SearchStructures/doc_tex/SearchStructures/main.tex
index 7a775a8af25..1085102e548 100644
--- a/Packages/SearchStructures/doc_tex/SearchStructures/main.tex
+++ b/Packages/SearchStructures/doc_tex/SearchStructures/main.tex
@@ -9,21 +9,22 @@
 
 %\ccChapterSubTitle{\rangetreeRevision, \rangetreeDate}
 
-\minitoc
+%\minitoc
 
 \section{Introduction}
 
-This chapter presents the {\cgal} range tree, segment tree, and $Kd$-tree 
+This chapter presents the {\cgal} range tree and segment 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
-$Kd$-tree implementation, in that it enables to layer together range trees 
-and segment trees in the same data structure.
+
+% 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
+% $Kd$-tree implementation, in that it enables to layer together range trees 
+% and segment trees in the same data structure.
 
 \input{defs}
 \input{software_design}
 \input{range_tree}
 \input{segment_tree}
-\input{kd-tree}
+
 
diff --git a/Packages/SearchStructures/doc_tex/basic/SearchStructures/main.tex b/Packages/SearchStructures/doc_tex/basic/SearchStructures/main.tex
index 7a775a8af25..1085102e548 100644
--- a/Packages/SearchStructures/doc_tex/basic/SearchStructures/main.tex
+++ b/Packages/SearchStructures/doc_tex/basic/SearchStructures/main.tex
@@ -9,21 +9,22 @@
 
 %\ccChapterSubTitle{\rangetreeRevision, \rangetreeDate}
 
-\minitoc
+%\minitoc
 
 \section{Introduction}
 
-This chapter presents the {\cgal} range tree, segment tree, and $Kd$-tree 
+This chapter presents the {\cgal} range tree and segment 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
-$Kd$-tree implementation, in that it enables to layer together range trees 
-and segment trees in the same data structure.
+
+% 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
+% $Kd$-tree implementation, in that it enables to layer together range trees 
+% and segment trees in the same data structure.
 
 \input{defs}
 \input{software_design}
 \input{range_tree}
 \input{segment_tree}
-\input{kd-tree}
+