[vtkusers] (no subject)

[Rackwitz, Karl]

Hello,

I am triangulating Pointclouds using Delaunay2D. Unfortunately it takes 8 seconds for a Pointcloud consisting of 30 000 Points to be triangulated.
Sizes of clouds reach up to 100 000 occasionaly. I was wondering, if there is a way to speed up the triangulation or use a different technique.

Here some Code:
--------
vtkSmartPointer<vtkDelaunay2D> del = vtkSmartPointer<vtkDelaunay2D>::New();
vtkSmartPointer<vtkPolyData> cloud = vtkSmartPointer<vtkPolyData>::New();
vtkSmartPointer<vtkPoints> pts = vtkSmartPointer<vtkPoints>::New();
pts->SetDataTypeToFloat();

for all points
	pts->InsertNextPoint( p );
	
cloud->setPoints( pts );
del->SetInput( cloud );
del->SetTolerance( 0.001 );
del->SetAlpha( 5 );
del->Update();
----------

The call to Update() consumes the mentioned time. I am running VS-2005 and Vtk 5.6.1 on an Intel Dual Core @ 2,53GHz and 2GB RAM.
I have found this mail regarding the topic:  http://public.kitware.com/pipermail/vtkusers/2008-January/093806.html
So maybe this is normal?

thanks in advance for any help.