[vtkusers] constrained delaunay triangulations

[Jacob Bensabat]

Hi
There is a code in vtk for voronoi diagrams/delaunay triangulations 
based on Fortune plane sweep algorithm (which is fast). I wonder if 
there is an implamentation
in vtk that allows for constraints (edges) within the triangulation, 
based on this algortihm.

Also I would like to ask if there is an example in c++ for using the 
existing constrained delaunay triangulation in vtk. the examples i have 
seen are in tcl, and I am
not familiar with this language.

thanks
jac.