An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids
From MaRDI portal
Publication:5451286
Recommendations
- An efficient and robust particle-localization algorithm for unstructured grids
- A set of particle locating algorithms not requiring face belonging to cellconnectivity data
- A generalized particle search-locate algorithm for arbitrary grids
- An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates
- An improved known vicinity algorithm based on geometry test for particle localization in arbitrary grid
Cited in
(10)- Particle host cell determination in unstructured grids
- A two-way coupled Euler-Lagrange method for simulating multiphase flows with discontinuous Galerkin schemes on arbitrary curved elements
- An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates
- A set of particle locating algorithms not requiring face belonging to cellconnectivity data
- A particle localization algorithm on unstructured curvilinear polynomial meshes
- An improved known vicinity algorithm based on geometry test for particle localization in arbitrary grid
- Localization schemes in 2D boundary-fitted grids
- A particle tracking algorithm for parallel finite element applications
- An efficient and robust particle-localization algorithm for unstructured grids
- An efficient and robust method for Lagrangian magnetic particle tracking in fluid flow simulations on unstructured grids
This page was built for publication: An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451286)
