[vtkusers] Complexity of Delaunay 3D Implementation in VTK

[Axel Steuwer]

Hi,

I don't know much about the complexity of the algorithm, but I noticed
that Delaunay2D does a good job even in non-2D geometrys.
I also use the Power Crust algorithm

http://www.eastman.ucl.ac.uk/~thutton/powercrust/

which is pretty fast. Worth a try.

Axel

> Hi, everybody,
>
> I'm trying to generate a triangulated mesh from a set of vertex of a box
> in movement and I though of using Delaunay3D for this generation. The
> object is introducing this mesh in a detect collision library for
> laparoscopic simulation, where the time requirements are critical. I
> have used but the calculation time is about 16 miliseconds, that I think
> isn't as fast as we'd want.
>
> To my knowledge there are some ways to calculate Delaunay triangulation
> with different complexity  (n2, n log n, ...).
>
> ¿Do somebody knows the complexity of the Delaunay3D implementation in
> VTK?
>
> If is the case, ¿Does anybody knows some more efficient Delaunay
> implementation code or some faster triangularization algorithms ?
>
> Thanks in advance.
>
> Samuel
>
>
>
> ====================================Samuel Rodríguez Bescós
> Grupo de Bioingeniería y Telemedicina
> ETSI Telecomunicación - UPM
> Ciudad Universitaria s/n
> 28040 MADRID - ESPAÑA
>
> Tel. +34 91 549 57 00 ext. 332
> Fax + 34 91 336 68 28
> e-mail: srodrigu at gbt.tfo.upm.es
> http://www.gbt.tfo.upm.es
> ==================================_______________________________________________
> This is the private VTK discussion list.
> Please keep messages on-topic. Check the FAQ at:
> <http://public.kitware.com/cgi-bin/vtkfaq> Follow this link to
> subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers