CGAL users discussion list

[Kuan <>]

Hi all,
I solve it like this now.
I get all the incident cells of a vertex ' v ' in Delaunay_triangulation_3. Then i can find all points in these cells. 
And i pick the points by compare the distance to v and to the vertices of the cells. If it's shorter, then it should be located in
Voronoi diagram of v.
Is it the only way to do it?
best regards
Kuan

2007/7/12, Kuan <>:

Hi ,all
I have some problem with Delaunay_triangulation_3 now. I actually want to get a Voronoi diagram in 3d, but as it doesn't exit in cgal i can only use Delaunay_triangulation_3 .
Now i want to get a cell of the Voronoi diagram( to find points located in this cell), so
i "should" use the dual of a finite vertex in Delaunay_triangulation_3 ? Right? But in Delaunay_triangulation_3 i can only find
dual of a cell or a facet, not a vertex.
Can any one help me ?
best regards,
Kuan