Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.07959 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915203944284160 |
|---|---|
| author | Chen, Shuang Yang, Fanyi |
| author_facet | Chen, Shuang Yang, Fanyi |
| contents | We present a particle locating method for unstructured meshes in two and three dimensions. Our algorithm is based on a patch searching process, and includes two steps. We first locate the given point to a patch near a vertex, and then the host element is determined within the patch domain. Here, the patch near a vertex is the domain of elements around this vertex. We prove that in the first step the patch can be rapidly identified by constructing an auxiliary Cartesian grid with a prescribed resolution. Then, the second step can be converted into a searching problem, which can be easily solved by searching algorithms. Only coordinates to particles are required in our method. We conduct a series of numerical tests in two and three dimensions to illustrate the robustness and efficiency of our method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_07959 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An efficient particle locating method on unstructured meshes in two and three dimensions based on patch searching Chen, Shuang Yang, Fanyi Numerical Analysis Computational Physics We present a particle locating method for unstructured meshes in two and three dimensions. Our algorithm is based on a patch searching process, and includes two steps. We first locate the given point to a patch near a vertex, and then the host element is determined within the patch domain. Here, the patch near a vertex is the domain of elements around this vertex. We prove that in the first step the patch can be rapidly identified by constructing an auxiliary Cartesian grid with a prescribed resolution. Then, the second step can be converted into a searching problem, which can be easily solved by searching algorithms. Only coordinates to particles are required in our method. We conduct a series of numerical tests in two and three dimensions to illustrate the robustness and efficiency of our method. |
| title | An efficient particle locating method on unstructured meshes in two and three dimensions based on patch searching |
| topic | Numerical Analysis Computational Physics |
| url | https://arxiv.org/abs/2408.07959 |