Delaunay3D: find a tetrahedron enclosing a query point

Hello.

Suppose I have built a 3D delaunay triangulation out of N points.  Now I
have a query point, and I need to find the tetrahedron of the triangulation
which encloses the query point.  How to do it?

I am aware of CellLocator, but the documentation warns that it might be
slow.  Is there some fast (and ideally simple) method that utilizes the fact
that the tetrahedrons are not arbitrary, but rather the result of 3D
delaunay?

Thank you,

leonid





--
Sent from: http://vtk.1045678.n5.nabble.com/VTK-Users-f1224199.html
_______________________________________________
Powered by www.kitware.com

Visit other Kitware open-source projects at http://www.kitware.com/opensource/opensource.html

Please keep messages on-topic and check the VTK FAQ at: http://www.vtk.org/Wiki/VTK_FAQ

Search the list archives at: http://markmail.org/search/?q=vtkusers

Follow this link to subscribe/unsubscribe:
https://vtk.org/mailman/listinfo/vtkusers