cgal/Box_intersection_d/doc_tex/Box_intersection_d/PkgDescription.tex

18 lines
718 B
TeX

\begin{ccPkgDescription}{Intersecting Sequences of dD Iso-oriented Boxes\label{Pkg:BoxIntersectionD}}
\ccPkgHowToCiteCgal{cgal:kmz-isiobd-12}
\ccPkgSummary{
An efficient algorithm for finding all intersecting pairs for large
numbers of iso-oriented boxes, in order to apply a user defined callback
on them. Typically these boxes will be bounding
boxes of more complicated geometries. The algorithm is useful for (self-) intersection
tests of surfaces etc.
}
%
%\ccPkgDependsOn{}
\ccPkgIntroducedInCGAL{3.1}
\ccPkgLicense{\ccLicenseGPL}
\ccPkgDemo{Operations on Polyhedra}{polyhedron_3.zip}
\ccPkgIllustration{Box_intersection_d/fig/box_inters-small.gif}{Box_intersection_d/fig/box_inters.gif}
\end{ccPkgDescription}