- **Main CFD Forum**
(*http://www.cfd-online.com/Forums/main/*)

- - **Fast searching on unstructured grids
**
(*http://www.cfd-online.com/Forums/main/4260-fast-searching-unstructured-grids.html*)

Fast searching on unstructured grids
Hi there,
I am looking for a fast searching scheme on unstructured grids (triangle and tetrahedral). For a given point, I want to find the element that contains this point. Thanks in advance. Tony |

Re: Fast searching on unstructured grids
Hi Tony,
Look to Lohner book "Applied CFD" p 11, 12 and 13. F++ |

Re: Fast searching on unstructured grids
I recommend the walking triangle algorithm. The paper associated with this site has a fair discription of this algorithm. This algorithm also has an easy extension to 3-D meshes but will require some additional thought if your domain is convex.
http://wwwrses.anu.edu.au/geodynamics/nn/SBM95/SBM.html Jeff |

All times are GMT -4. The time now is 07:50. |