[vtkusers] constrained delaunay triangulations

[Will Schroeder]

vtkDelaunay2D supports constraint edges and polygons. There are code 
examples in VTK/Graphics/Testing/Tcl such as constrainedDelaunay2D.tcl (use 
grep with vtkDelaunay2D to find more examples). Tcl is almost a 1-for-1 
translation to C++, takes about three minutes to learn.

Will

At 09:13 AM 11/9/2002 -0800, Jacob Bensabat wrote:
>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.

William J. Schroeder, Ph.D
Kitware, Inc.
469 Clifton Corporate Parkway
Clifton Park, NY 12065
will.schroeder at kitware.com
1-518-371-3971 x102
1-518-371-3971 (fax)