Best Search algorithm for Unstructured Meshing?
 

Hey guys,

I am currently writing an unstructured Mesher in 3D based on the Delaunay Triangulation. I have implemented some kind of a directional search to locate a point inside a tetrahedron. This seems to be kind of inefficient. Does anyone have any idea as to which algorithm would be best for this kind of search? Since the meshing is an iterative process, at some stage of the iteration I have a tetrahedralization T. For this T I would want to find out which Tet some new point lies in. Thanks. Dinesh

Re: Best Search algorithm for Unstructured Meshing
 

Is this to locate an orphan node inside an existing cell? If it is a search based on proximity, I think Dr. Lohner's book will be an excellent starting point.

here's the link @ amazon.com http://www.amazon.com/exec/obidos/tg...books&n=507846

Re: Best Search algorithm for Unstructured Meshing
 

The sollowing is for 2D but might still be useful.

http://www.ecse.rpi.edu/Homepages/wr...es/pnpoly.html

Re: Best Search algorithm for Unstructured Meshing
 

Hi, what kind of method you are using ? I noticed that Lawson's method were mentioned in some papers.

Regards

Li