[vtkusers] Why is vtkDelaunay2D so slow in VC++ 2005

[burlen]

Hi, Delaunay is slow algorithm in general, it has to work point by point 
and make a search through the point set with each insertion. I am not 
sure about VTK but I have seen the time complexity of other 
implementations is O(n*log(n)). It sounds like you by hand approach is 
O(n) so would be much faster. You mentioned that you think it is related 
to VC++ 2005 but I think it is the delaunay algorithm itself rather than 
the platform which is the problem. have you tried under another platform?
Burlen


Godofredo wrote:
> Hi to all, I've been doing some triangulations with big datasets and found
> out that vtkDelaunay2D is extremely slow in VC++ 2005. I've done the
> triangulation by hand (as my data came from a range scanner I just join the 
> verts in order) and It takes only seconds to triangulate what with
> vtkDelaunay2D takes almost 2 minutes. I've found in the forums a post that
> talked about the same problem but had no replys. Anyone could put some light
> into this? Many thanks.
>