CGAL users discussion list

[Monique Teillaud <>]

Hi Faniry,

Do you really want to implement our old Delaunay tree...?

You should be aware that CGAL proposes the Delaunay hierarchy, which is 
a more recent structure that speeds up point location in a Delaunay 
triangulation.
See
http://www.cgal.org/Manual/3.4/doc_html/cgal_manual/Triangulation_2_ref/Class_Triangulation_hierarchy_2.html#Cross_link_anchor_1172
The 3D version is also available in CGAL.

Best,
        Monique Teillaud


 wrote:
> Hi all,
>
> I built a structure for the Delaunay tree (DTree). My problem is the 
> following:
>
> when I insert the first point (p1,p2), it works well, which means.
>
> DTree.node = the big first triangle
> DTree.child = {delta_1,delta_2,delta_3}
>
> Now, when I insert the second point the location work well, suppose it is in
> delta_3,
>
> Now, I build a child for delta_3 using insert_in_face and incident_faces
>
> Since, insert_in_face destruct delta_3, the delta_3 of DTree changes also. But
> I want to keep it for the next location.
>
> Is there a way to use insert_in_face and keep in an another memory the initial
> face such us we can use it later on?
>
> Regards
> Faniry