[vtkusers] Delaunay3D: find a tetrahedron enclosing a query point

[kenichiro yoshimi]

Hi,

Though I'm not sure how helpful that will be for performance
improvement, there is a protected member function FindTetra() in
vtkDelaunay3D. This way doesn't make use of the Delaunay properties
such as convexity, but it might be faster than CellLocator. However,
if you try, you need to re-implement this because this cannot be
directly accessed outside of the class.

Regards,

2019年1月16日(水) 16:36 leonid <leonid.gluhovsky at gmail.com>:
>
>
> 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