diff --git a/Packages/Spatial_searching/doc_tex/Spatial_searching/intro.tex b/Packages/Spatial_searching/doc_tex/Spatial_searching/intro.tex index 8ee0ede2fb0..d24b6e3e4e5 100755 --- a/Packages/Spatial_searching/doc_tex/Spatial_searching/intro.tex +++ b/Packages/Spatial_searching/doc_tex/Spatial_searching/intro.tex @@ -498,6 +498,12 @@ and for the requirements on the definition of user defined $d$-dimensional point In contrast with the old $k$-$d$ tree implementation, the spatial searching package requires that the \ccc{Kdtree_d::Box} is bounded. +The user can move from the old $k$-$d$ tree implementation to the spatial searching package by +replacing in his code \\ +#include +by +#include . + Further, the spatial searching package requires that the user provides for a user defined point class \ccc{My_Point} a nested representation class \ccc{My_Point::R} or specializes \ccc{CGAL::Kernel_traits} for \ccc{My_Point::R}. diff --git a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching/intro.tex b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching/intro.tex index 8ee0ede2fb0..d24b6e3e4e5 100755 --- a/Packages/Spatial_searching/doc_tex/basic/Spatial_searching/intro.tex +++ b/Packages/Spatial_searching/doc_tex/basic/Spatial_searching/intro.tex @@ -498,6 +498,12 @@ and for the requirements on the definition of user defined $d$-dimensional point In contrast with the old $k$-$d$ tree implementation, the spatial searching package requires that the \ccc{Kdtree_d::Box} is bounded. +The user can move from the old $k$-$d$ tree implementation to the spatial searching package by +replacing in his code \\ +#include +by +#include . + Further, the spatial searching package requires that the user provides for a user defined point class \ccc{My_Point} a nested representation class \ccc{My_Point::R} or specializes \ccc{CGAL::Kernel_traits} for \ccc{My_Point::R}.