songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

*** empty log message ***

This commit is contained in:
Hans Tangelder 2003-09-09 13:08:02 +00:00
parent 1382f34ea3
commit 443b0c76f7
2 changed files with 12 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Packages/Spatial_searching/doc_tex/Spatial_searching/intro.tex
View File

@ -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<Traits>::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 <CGAL/Kd_tree_d.h>
by
#include <CGAL/Kd_tree_d_new.h>.
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}.

6
Packages/Spatial_searching/doc_tex/basic/Spatial_searching/intro.tex
View File

@ -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<Traits>::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 <CGAL/Kd_tree_d.h>
by
#include <CGAL/Kd_tree_d_new.h>.
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}.