CGAL users discussion list

[Michael Klatt <>]

Dear all,

To triangulate a point set in the three-dimensional flat torus,
CGAL::Periodic_3_Delaunay_triangulation_3 offers a very good solution to my
needs, switching between Delaunay and Voronoi tessellations.

For each vertex, I want to first iterate over all incident edges and then
(for each edge) circulate over all cells incident to the given edge.
My current code relies on the functions 
     OutputIterator incident_edges (Vertex_handle v, OutputIterator edges)
const
and
     Cell_circulator incident_cells (Edge e) const
Thus I obtain a Cell_handle.

How can I choose the representative (tetrahedron in Euclidean space) that
has the initial vertex as one of its four vertices?

For example, if the vertex for which I pick an incident edge has coordinates
(0.1,0.1,0.1), I would like to obtain a tetrahedron whose other points have
negative coordinates, rather than the tetrahedron that is at the opposite
end of the 1- or 27-sheeted covering space.
The latter is the result of my attempt using
     T.tetrahedron(T.periodic_tetrahedron(cit));
(due to my CGAL version 4.7).

Of course, I can manually translate the tetrahedron, but is there a built-in
solution?

Thank you very much!
Best regards,

Michael




--
Sent from: http://cgal-discuss.949826.n4.nabble.com/