CGAL users discussion list

[Vicente Helano <>]

Dears,

  I am implementing a vertex-based data structure for representing 2d
triangulations, and I'd like to plug it into the CGAL Delaunay
triangulation at the end, as a custom TDS. Given a 2d triangulation T,
I firstly compute a subset X of the vertex set V. The set X has the
property that every face in T has at least one vertex in X. CG people
would call X a "guards" set, and graph theory people would call it a
"triangle-transversal". The idea of the representation is simple. We
maintain the link for the vertex guards only, plus another graph on
its top for storing adjacency relations between guarded regions, which
are triangle patches.
 The question I would really like to ask you is whether it is possible
to plug this data structure as a custom TDS into the
Delaunay_triangulation_2 class, i.e., whether it's possible to make it
a model of the TriangulationDataStructure_2 concept. The problem is
that we do not have a container of faces anymore, because the faces
are now implicitly represented as triples of vertices. Could someone
give me any insight on this, please?

Thanks in advance,
 Vicente.