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

Laurent's remarks

This commit is contained in:
Camille Wormser 2009-05-05 11:27:29 +00:00
parent f87800c489
commit 202b7c95d5
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
AABB_tree/doc_tex/AABB_tree_ref/AABB_tree.tex
View File

@ -26,7 +26,7 @@ The class \ccRefName\ is a static data structure for efficient intersection and
\ccTypes \ccTypes
\ccTypedef{typedef AT::FT FT;} \ccTypedef{typedef AT::FT FT;}
{Field number type.} {Number type returned by the distance queries.}
\ccGlue \ccGlue
\ccTypedef{typedef AT::Point_3 Point;} \ccTypedef{typedef AT::Point_3 Point;}
{Type of 3D point.} {Type of 3D point.}
@ -45,7 +45,7 @@ The class \ccRefName\ is a static data structure for efficient intersection and
\ccCreation \ccCreation
\ccCreationVariable{tree} %% variable name \ccCreationVariable{tree} %% variable name
\ccConstructor{AABB_tree();}{Default constructor.} \ccConstructor{AABB_tree();}{Constructs an empty tree.}
\ccConstructor{template < class ConstPrimitiveIterator> \ccConstructor{template < class ConstPrimitiveIterator>
AABB_tree( ConstPrimitiveIterator begin, AABB_tree( ConstPrimitiveIterator begin,
ConstPrimitiveIterator beyond);} ConstPrimitiveIterator beyond);}
@ -58,7 +58,7 @@ The class \ccRefName\ is a static data structure for efficient intersection and
ConstPrimitiveIterator beyond);} ConstPrimitiveIterator beyond);}
{Clears the current tree and rebuilds it from scratch. See constructor above for the parameters. Returns \ccc{true}, iff the memory allocation is successful. } {Clears the current tree and rebuilds it from scratch. See constructor above for the parameters. Returns \ccc{true}, iff the memory allocation is successful. }
\ccMethod{void clear(void);} \ccMethod{void clear();}
{Clears the AABB tree. } {Clears the AABB tree. }
\ccMethod{Bounding_box bbox();} \ccMethod{Bounding_box bbox();}