diff --git a/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/Kd_tree_rectangle.tex b/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/Kd_tree_rectangle.tex
index 54e596db12f..80eb105e470 100755
--- a/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/Kd_tree_rectangle.tex
+++ b/Packages/Spatial_searching/doc_tex/Spatial_searching_ref/Kd_tree_rectangle.tex
@@ -59,10 +59,6 @@ Kd_tree_rectangle(int d, PointIter begin, PointIter end);}
 \ccMethod{void set_lower_bound(int i, const NT& x);}
 {Sets lower bound in dimension \ccc{i} to \ccc{x}.}
  
-\ccMethod{ template <class PointPointerIter>
-void update_from_point_pointers(PointPointerIter begin, PointPointerIter end, bool empty);}
-{Updates the rectangle $r$ as the the bounding box of the points accessed by the pointers
- in the range [begin,end). If empty is true the result is an empty bounding box.} 
  
 \ccMethod{NT max_span();}
 {Returns the maximal span of the rectangle.}
diff --git a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/Kd_tree_rectangle.tex b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/Kd_tree_rectangle.tex
index 54e596db12f..80eb105e470 100755
--- a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/Kd_tree_rectangle.tex
+++ b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching_ref/Kd_tree_rectangle.tex
@@ -59,10 +59,6 @@ Kd_tree_rectangle(int d, PointIter begin, PointIter end);}
 \ccMethod{void set_lower_bound(int i, const NT& x);}
 {Sets lower bound in dimension \ccc{i} to \ccc{x}.}
  
-\ccMethod{ template <class PointPointerIter>
-void update_from_point_pointers(PointPointerIter begin, PointPointerIter end, bool empty);}
-{Updates the rectangle $r$ as the the bounding box of the points accessed by the pointers
- in the range [begin,end). If empty is true the result is an empty bounding box.} 
  
 \ccMethod{NT max_span();}
 {Returns the maximal span of the rectangle.}