CGAL users discussion list

["Jingyi Jin" <>]

Dear all,

Could any one please tell me what is the best way to retrieve the dual
of a Delaunay vertex in a 3D triangulation?  My problem is to compute
the intersection of arbitrary segments and polygons with the walls of
that dual complex.  My initial idea is to get the incident edges of
the vertex, and retrieve the duals of these edges one by one. However,
I could not find a simple way to get the incident edges of a vertex.
Could any one please tell me what would be the most convenient way to
do that?

Thanks a lot for any input!

Sincerely,

Jingyi