CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

There is no 2D AABB-tree for now.

You can try the 3D version but I'm not sure you can easily do this.

Note that depending on what you want to do, the triangulation hierarchy
offer fast point location in the triangulation [1], and the line_walk 
function [2] allows to traverse a set of facets intersected by a segment.


Sebastien.

[1] 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_2/Chapter_main.html#Section_37.10
[2] 
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_2.html#Function_Line_face_circulator_line_walk6const_Point__p+_const_Point__q+_Face_handle_f_=_Face_handle699_const;

On 04/05/2013 03:48 PM, Ramin H wrote:
> Hi everyone,
>
> I have previously used the 3D AABB Tree in CGAL to do fast queries
> against a 3D mesh of tetrahedrons.
>
> I was wondering if there is a 2D AABB Tree algorithm in CGAL to do
> queries against a 2D triangulation?
>
> Or can the 3D AABB Tree be used for a 2D triangulation?
>
> Thanks,
> Ramin