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

still polishing (just typos)

This commit is contained in:
Camille Wormser 2009-05-08 09:27:27 +00:00
parent 7ad4cdfa4b
commit 31e85b74de
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/examples.tex
View File

@ -2,11 +2,11 @@
\label{AABB_tree_section_examples}
\subsection{Tree of triangles with a copy of geometric data, for line queries and closest point queries}
In the following example a set of 3D triangles is stored in a list. The AABB primitive wraps a triangle and an iterator in the list. We computes the number of intersections between a 3D line and the input triangles, and the closest point from a query point to the input triangles.
In the following example, a set of 3D triangles is stored in a list. The AABB primitive wraps a triangle and an iterator in the list. We compute the number of input triangles intersected by a 3D line, and the closest point from a query point to the input triangles.
\ccIncludeExampleCode{AABB_tree/AABB_triangle_3_example.cpp}
\subsection{Tree of triangles without copying geometric data, for ray queries}
The following example computes the number of intersections between a 3D ray and a set of facets of a triangle polyhedral surface. The AABB primitive wraps a facet handle and generates a 3D triangle on the fly each time its object function is called.
The following example computes the number of intersections between a 3D ray and a set of facets of a triangle polyhedral surface. The AABB primitive wraps a facet handle and generates a 3D triangle on the fly, each time its object function is called.
\ccIncludeExampleCode{AABB_tree/AABB_polyhedron_facet_example.cpp}
\subsection{Tree of segments with a copy of geometric data, for plane queries}
@ -14,5 +14,5 @@ The following example computes the number of intersections between a 3D plane an
\ccIncludeExampleCode{AABB_tree/AABB_segment_3_example.cpp}
\subsection{Tree of segments without copying geometric data, for plane queries}
The following example computes the number of intersections between a 3D plane and a set of edges of a triangle polyhedral surfaces. The AABB primitive wraps a halfedge handle and generates a 3D segment on the fly each time its object function is called.
The following example computes the number of intersections between a 3D plane and a set of edges of a triangle polyhedral surface. The AABB primitive wraps a halfedge handle and generates a 3D segment on the fly, each time its object function is called.
\ccIncludeExampleCode{AABB_tree/AABB_polyhedron_edge_example.cpp}