From 2c7033c74a91bcbf3046ee79ec57012ea76b49c3 Mon Sep 17 00:00:00 2001
From: Pierre Alliez <Pierre.Alliez@sophia.inria.fr>
Date: Thu, 30 Apr 2009 13:45:11 +0000
Subject: [PATCH] AABB tree (ref manual): added headings

---
 AABB_tree/doc_tex/AABB_tree_ref/AABB_tree.tex | 22 +++++++++----------
 1 file changed, 11 insertions(+), 11 deletions(-)

diff --git a/AABB_tree/doc_tex/AABB_tree_ref/AABB_tree.tex b/AABB_tree/doc_tex/AABB_tree_ref/AABB_tree.tex
index 7d290381c20..de0665c3b2d 100644
--- a/AABB_tree/doc_tex/AABB_tree_ref/AABB_tree.tex
+++ b/AABB_tree/doc_tex/AABB_tree_ref/AABB_tree.tex
@@ -38,12 +38,11 @@ The template parameter \ccc{Traits} stands for a traits class which must be a mo
 \ccGlue
 \ccTypedef{Point_and_primitive}
           {A pair composed of a Point and a Primitive.}
-\ccGlue
 
 %\ccNestedType{AABB}{some nested types}
 
 \ccCreation
-\ccCreationVariable{tree}  %% variable name
+\ccCreationVariable{tree} %% variable name
 
 \ccConstructor{AABB_tree();}{Default constructor.}
 \ccConstructor{template < class ConstPrimitiveIterator>
@@ -63,18 +62,9 @@ The template parameter \ccc{Traits} stands for a traits class which must be a mo
 \ccMethod{void clear(void);}
 {Clears the current tree. }
 
-\ccMethod{void construct_search_tree();}
-{ Constructs the internal search KD-tree used to accelerate the projection queries. The points in the search tree are taken from the primitives by calling the function \ccc{point_on} from the primitive.}
-
-\ccMethod{template <class ConstPointIterator>
-void construct_search_tree(ConstPointIterator begin,
-                           ConstPointIterator beyond);}
-{ Constructs the internal search KD-tree used to accelerate the projection queries from a specified point set. }
-
 % INTERSECTION TESTS
 \ccHeading{Intersection Tests}
 
-
 \ccMethod{ template <class Query>
 	  bool do_intersect(const Query & q);}
 { Returns \ccc{true} iff the query intersects the primitives. Type \ccc{Query} has to be a type for which \ccc{do_intersect} predicates have been defined in \ccc{Traits}.}
@@ -135,6 +125,16 @@ squared_distance(const Point& query,
                  const Point & hint);} 
 {Returns the squared distance between the query point and all input primitives. See \ccc{closest_point} function for the \ccc{hint} parameter. }
 
+\ccHeading{Accelerating the projection queries}
+
+\ccMethod{void construct_search_tree();}
+{ Constructs the internal search KD-tree used to accelerate the projection queries. The points in the search tree are taken from the primitives by calling the function \ccc{point_on} from the primitive.}
+
+\ccMethod{template <class ConstPointIterator>
+void construct_search_tree(ConstPointIterator begin,
+                           ConstPointIterator beyond);}
+{ Constructs the internal search KD-tree used to accelerate the projection queries from a specified point set. }
+
 \ccSeeAlso
 
 \ccc{AABBTraits}, \\