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

Removed \input{kdtree}

This commit is contained in:
Andreas Fabri 2003-10-01 14:18:30 +00:00
parent 1fd9fefd1c
commit e5b4441cd5
2 changed files with 18 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
Packages/SearchStructures/doc_tex/SearchStructures/main.tex
View File

@ -9,21 +9,22 @@
%\ccChapterSubTitle{\rangetreeRevision, \rangetreeDate}
\minitoc
%\minitoc
\section{Introduction}
This chapter presents the {\cgal} range tree, segment tree, and $Kd$-tree
This chapter presents the {\cgal} range tree and segment tree
data structures.
The range tree is theoretically superior to the $Kd$-tree, but the
latter often seems to perform better.
However, the range tree as implemented in {\cgal} is more flexible than the
$Kd$-tree implementation, in that it enables to layer together range trees
and segment trees in the same data structure.
% The range tree is theoretically superior to the $Kd$-tree, but the
% latter often seems to perform better.
% However, the range tree as implemented in {\cgal} is more flexible than the
% $Kd$-tree implementation, in that it enables to layer together range trees
% and segment trees in the same data structure.
\input{defs}
\input{software_design}
\input{range_tree}
\input{segment_tree}
\input{kd-tree}

17
Packages/SearchStructures/doc_tex/basic/SearchStructures/main.tex
View File

@ -9,21 +9,22 @@
%\ccChapterSubTitle{\rangetreeRevision, \rangetreeDate}
\minitoc
%\minitoc
\section{Introduction}
This chapter presents the {\cgal} range tree, segment tree, and $Kd$-tree
This chapter presents the {\cgal} range tree and segment tree
data structures.
The range tree is theoretically superior to the $Kd$-tree, but the
latter often seems to perform better.
However, the range tree as implemented in {\cgal} is more flexible than the
$Kd$-tree implementation, in that it enables to layer together range trees
and segment trees in the same data structure.
% The range tree is theoretically superior to the $Kd$-tree, but the
% latter often seems to perform better.
% However, the range tree as implemented in {\cgal} is more flexible than the
% $Kd$-tree implementation, in that it enables to layer together range trees
% and segment trees in the same data structure.
\input{defs}
\input{software_design}
\input{range_tree}
\input{segment_tree}
\input{kd-tree}