diff --git a/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/K_neighbor_search.tex b/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/K_neighbor_search.tex
index 48d884e64d0..060a05db890 100755
--- a/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/K_neighbor_search.tex
+++ b/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/K_neighbor_search.tex
@@ -74,7 +74,7 @@ Inserts statistics of the search process into the output stream \ccc{s}.
 
 \ccSeeAlso
 
-\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, Distance, Splitter, SpatialTree>}.
+\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, OrthogonalDistance, Splitter, SpatialTree>}.
 
 \end{ccRefClass}
 
diff --git a/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/intro.tex b/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/intro.tex
index 1af3def0d8e..dd20bd8bc13 100755
--- a/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/intro.tex
+++ b/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/intro.tex
@@ -1,9 +1,8 @@
 \chapter{Spatial Searching}
 \label{ChapterReferenceSpatialSearching}
 
-The {\bf spatial searching} package implements
-exact and approximate distance browsing
-by providing implementations of algorithms supporting
+This package implements exact and approximate distance browsing by
+providing implementations of algorithms supporting
 
 \begin{itemize} 
 
@@ -30,16 +29,15 @@ query items representing points and spatial objects.
 In these searching problems a set $P$ of data points in $d$-dimensional
 space is given.
 
-The spatial searching package 
-consists of the following concepts and classes
-that are described in the reference pages.
+The spatial searching package consists of the following concepts and
+classes that are described in the reference pages.
 
 \ccHeading{Concepts}
 
 \ccRefConceptPage{Ball_d} \\
 \ccRefConceptPage{FuzzyQueryItem} \\
 \ccRefConceptPage{GeneralDistance} \\ 
-\ccRefConceptPage{IsoBox_d} \\
+\ccRefConceptPage{IsoBox} \\
 \ccRefConceptPage{OrthogonalDistance} \\
 \ccRefConceptPage{PointContainer} \\
 \ccRefConceptPage{QueryItem} \\
@@ -58,8 +56,8 @@ that are described in the reference pages.
 \ccRefIdfierPage{CGAL::Fuzzy_sphere<PointTraits>} \\
 \ccRefIdfierPage{CGAL::Incremental_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
 \ccRefIdfierPage{CGAL::K_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
-\ccRefIdfierPage{CGAL::Kd_tree<TreeTraits>} \\
-\ccRefIdfierPage{CGAL::Kd_tree_node<TreeTraits>} \\
+\ccRefIdfierPage{CGAL::Kd_tree<PointTraits>} \\
+\ccRefIdfierPage{CGAL::Kd_tree_node<PointTraits>} \\
 \ccRefIdfierPage{CGAL::Kd_tree_rectangle<NT>} \\
 \ccRefIdfierPage{CGAL::Kd_tree_traits_point<PointTraits, Splitter>} \\
 \ccRefIdfierPage{CGAL::Manhattan_distance_iso_box_point<PointTraits, IsoBox>} \\
diff --git a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/K_neighbor_search.tex b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/K_neighbor_search.tex
index 48d884e64d0..060a05db890 100755
--- a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/K_neighbor_search.tex
+++ b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/K_neighbor_search.tex
@@ -74,7 +74,7 @@ Inserts statistics of the search process into the output stream \ccc{s}.
 
 \ccSeeAlso
 
-\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, Distance, Splitter, SpatialTree>}.
+\ccc{CGAL::Orthogonal_k_neighbor_search<PointTraits, OrthogonalDistance, Splitter, SpatialTree>}.
 
 \end{ccRefClass}
 
diff --git a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/intro.tex b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/intro.tex
index 1af3def0d8e..dd20bd8bc13 100755
--- a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/intro.tex
+++ b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/intro.tex
@@ -1,9 +1,8 @@
 \chapter{Spatial Searching}
 \label{ChapterReferenceSpatialSearching}
 
-The {\bf spatial searching} package implements
-exact and approximate distance browsing
-by providing implementations of algorithms supporting
+This package implements exact and approximate distance browsing by
+providing implementations of algorithms supporting
 
 \begin{itemize} 
 
@@ -30,16 +29,15 @@ query items representing points and spatial objects.
 In these searching problems a set $P$ of data points in $d$-dimensional
 space is given.
 
-The spatial searching package 
-consists of the following concepts and classes
-that are described in the reference pages.
+The spatial searching package consists of the following concepts and
+classes that are described in the reference pages.
 
 \ccHeading{Concepts}
 
 \ccRefConceptPage{Ball_d} \\
 \ccRefConceptPage{FuzzyQueryItem} \\
 \ccRefConceptPage{GeneralDistance} \\ 
-\ccRefConceptPage{IsoBox_d} \\
+\ccRefConceptPage{IsoBox} \\
 \ccRefConceptPage{OrthogonalDistance} \\
 \ccRefConceptPage{PointContainer} \\
 \ccRefConceptPage{QueryItem} \\
@@ -58,8 +56,8 @@ that are described in the reference pages.
 \ccRefIdfierPage{CGAL::Fuzzy_sphere<PointTraits>} \\
 \ccRefIdfierPage{CGAL::Incremental_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
 \ccRefIdfierPage{CGAL::K_neighbor_search<PointTraits, GeneralDistance, Splitter, SpatialTree>} \\
-\ccRefIdfierPage{CGAL::Kd_tree<TreeTraits>} \\
-\ccRefIdfierPage{CGAL::Kd_tree_node<TreeTraits>} \\
+\ccRefIdfierPage{CGAL::Kd_tree<PointTraits>} \\
+\ccRefIdfierPage{CGAL::Kd_tree_node<PointTraits>} \\
 \ccRefIdfierPage{CGAL::Kd_tree_rectangle<NT>} \\
 \ccRefIdfierPage{CGAL::Kd_tree_traits_point<PointTraits, Splitter>} \\
 \ccRefIdfierPage{CGAL::Manhattan_distance_iso_box_point<PointTraits, IsoBox>} \\