CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

On 02/29/2012 03:27 PM, Jakob van Bethlehem wrote:
> On 02/29/2012 02:21 PM, Sebastien Loriot (GeometryFactory) wrote:
> > On 02/29/2012 01:58 PM, Jakob van Bethlehem wrote:
> > > Hello,
> > >
> > > As a new subscriber to this list, I'm not exactly sure if this is the
> > > right place to pose my question, but if not, maybe someone can
> > > redirect me.
> > > What I'm basically trying to achieve is the procedure described in
> > > http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3/Chapter_main.html#Subsection_38.5.3
> > Unfortunately, this is not working for periodic triangulations.
> >
> > Your typedefs are correct, but you need to insert points one by one and
> > set the info after.
> >
> > Vertex_handle v=pdt.insert(pt);
> > v->info()=Info();
> >
> > Sebastien.
> >
> > >
> [..]
>
> Hej,
>
> That was a very quick response. Thanks for that, although the outcome is
> kind of frustrating, since I need to insert lots and lots of points this
> way and using this method I don't have access to the optimizations that
> are available to do that :( I'll try to refactor the code a bit to see
> if I can circumvent this.
>
> Sincerely,
> Jakob

Well, that should not be hard to do because the mechanism is already 
here for the spatial sorting algorithm.

If you look in Delaunay_triangulation_3.h and all parts surrounded by
#ifdef/#ifndef CGAL_TRIANGULATION_3_DONT_INSERT_RANGE_OF_POINTS_WITH_INFO

you can easily adapt that to the periodic insert.

I don't have time to do it these days but if you provide a patch, I'll 
be glad to review it and submit it to CGAL.

Sebastien.