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 2002-11-01 10:27:31 +00:00
parent ff30fe44f5
commit 57a0d6f1fe
4 changed files with 12 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
Packages/kdtree/doc_tex/SearchStructures/kd-tree.tex
View File

@ -64,8 +64,8 @@
Kd-trees are implemented by Kd-trees are implemented by
the class \ccc{Kdtree_d}, that is parameterized with a traits class defining the class \ccc{Kdtree_d}, that is parameterized with a traits class defining
the interface between the class and the geometric primitives used. the interface between the class and the geometric primitives used.
For the description of the traits classes \ccc{Kd_Interface}, \ccc{Kd_Interface_2d} For the description of the traits classes \ccc{Kd_interface}, \ccc{Kd_interface_2d}
and \ccc{Kd_Interface_3d} provided by {\cgal} please refer to the reference pages. and \ccc{Kd_interface_3d} provided by {\cgal} please refer to the reference pages.
Also refer to the reference pages, for the description of the formal requirements for a class to be Also refer to the reference pages, for the description of the formal requirements for a class to be
a kd-tree traits class by the concept \ccc{Kdtree_d_traits}. a kd-tree traits class by the concept \ccc{Kdtree_d_traits}.
% {\cgal} provides ready-made interface classes that are presented in % {\cgal} provides ready-made interface classes that are presented in
@ -141,6 +141,7 @@ The {\kdt} is built using 2D points from the CGAL kernel.
#include <CGAL/Cartesian.h> #include <CGAL/Cartesian.h>
#include <iostream> #include <iostream>
#include <iterator>
#include <ctime> #include <ctime>
#include <cassert> #include <cassert>
#include <list> #include <list>
@ -159,6 +160,8 @@ int main()
CGAL::Kdtree_d<kd_interface> tree(2); CGAL::Kdtree_d<kd_interface> tree(2);
points_list l, res; points_list l, res;
srand( (unsigned)time(NULL) );
std::cout << "Insering evenly 81 points in the square (0,0)-(10,10) ...\n\n"; std::cout << "Insering evenly 81 points in the square (0,0)-(10,10) ...\n\n";
for (int i=1; i<10; i++) for (int i=1; i<10; i++)
for (int j=1; j<10; j++) for (int j=1; j<10; j++)

7
Packages/kdtree/doc_tex/basic/SearchStructures/kd-tree.tex
View File

@ -64,8 +64,8 @@
Kd-trees are implemented by Kd-trees are implemented by
the class \ccc{Kdtree_d}, that is parameterized with a traits class defining the class \ccc{Kdtree_d}, that is parameterized with a traits class defining
the interface between the class and the geometric primitives used. the interface between the class and the geometric primitives used.
For the description of the traits classes \ccc{Kd_Interface}, \ccc{Kd_Interface_2d} For the description of the traits classes \ccc{Kd_interface}, \ccc{Kd_interface_2d}
and \ccc{Kd_Interface_3d} provided by {\cgal} please refer to the reference pages. and \ccc{Kd_interface_3d} provided by {\cgal} please refer to the reference pages.
Also refer to the reference pages, for the description of the formal requirements for a class to be Also refer to the reference pages, for the description of the formal requirements for a class to be
a kd-tree traits class by the concept \ccc{Kdtree_d_traits}. a kd-tree traits class by the concept \ccc{Kdtree_d_traits}.
% {\cgal} provides ready-made interface classes that are presented in % {\cgal} provides ready-made interface classes that are presented in
@ -141,6 +141,7 @@ The {\kdt} is built using 2D points from the CGAL kernel.
#include <CGAL/Cartesian.h> #include <CGAL/Cartesian.h>
#include <iostream> #include <iostream>
#include <iterator>
#include <ctime> #include <ctime>
#include <cassert> #include <cassert>
#include <list> #include <list>
@ -159,6 +160,8 @@ int main()
CGAL::Kdtree_d<kd_interface> tree(2); CGAL::Kdtree_d<kd_interface> tree(2);
points_list l, res; points_list l, res;
srand( (unsigned)time(NULL) );
std::cout << "Insering evenly 81 points in the square (0,0)-(10,10) ...\n\n"; std::cout << "Insering evenly 81 points in the square (0,0)-(10,10) ...\n\n";
for (int i=1; i<10; i++) for (int i=1; i<10; i++)
for (int j=1; j<10; j++) for (int j=1; j<10; j++)

2
Packages/kdtree/examples/kdtrees/example1.C
View File

@ -62,7 +62,7 @@ int main()
tree.search( std::back_inserter( res ), r ); tree.search( std::back_inserter( res ), r );
std::cout << "Listing of the points in the square: \n" ; std::cout << "Listing of the points in the square: \n";
std::copy (res.begin(),res.end(),std::ostream_iterator<point>(std::cout," \n") ); std::copy (res.begin(),res.end(),std::ostream_iterator<point>(std::cout," \n") );
std::cout << std::endl; std::cout << std::endl;

2
Packages/kdtree/examples/kdtrees/example2.C
View File

@ -3,7 +3,7 @@
* Simple example the CGAL KD-tree module. * Simple example the CGAL KD-tree module.
* *
* Written by Sariel Har-Peled * Written by Sariel Har-Peled
* Iddo Hanniel * Iddo Hanniel
\*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*/ \*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*/
#include <CGAL/Cartesian.h> #include <CGAL/Cartesian.h>