CGAL users discussion list

[<>]

Hello,

I'm presently working on Code_TYMPAN, an Open Source project for industrial
site acoustics (www.code-tympan.org).

I've already introduced CGAL into the project to triangulate terrain. By the
way, thanks to the developer's and the community for the nice work, especially
on the documentation of triangulation

The terrain is defined as a set of isolevel polylines, so I have used
Constrained_Delaunay_triangulation_2 to build a triangulation of the terrain
compatible with the isolines.

Now I feel the need for a geometrical query accelerating structure and, a
little googling further, I have discovered Point_set_2 within CGAL, which
relies on Delaunay triangulations. I've been pretty happy, hoping I could
"just plug" the existing triangulation into the Point_set_2...

But now I peek at the code and I see that Point_set_2<Gt,Tds> inherits
directly from Delaunay_triangulation_2<Gt,Tds> and so I do not see any
apparent mean to plug a Constrained_Delaunay_triangulation_2<Gt,Tds>. Moreover
I remember that mathematically a constrained Delaunay triangulation is
actually *not* a Delaunay triangulation !


Enough context, here are the actual questions :

* is the constrained delaunay property too weak to satisfy the mathematical
requirements of the query logics in Point_set_2 ? (so that their is no point
hoping to plug the later on the former)

* is there a way I could adapt / extend the library and contribute a way to
answer queries on Constrained_Delaunay_2 instances

* is there other accelerating query structures usable for constrained /not-
really-Delaunay/ triangulations ?

Thanks for your guidance and expertise.
I would be glad to contribute potential development that could stem from this.

Best regards,
Anthony

--
Anthony Truchet - LOGILAB, Toulouse (France).
Tél: +33 (0)5 62 17 16 42