A set of particle locating algorithms not requiring face belonging to cellconnectivity data

DOI10.1016/J.JCP.2009.06.031zbMath1421.76175OpenAlexW2003656614MaRDI QIDQ732989

M. Sani, Mohammad Said Saidi

Publication date: 15 October 2009

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2009.06.031

zbMATH Keywords

arbitrary polyhedral gridface belonging to cell connectivityhost cellparticle locating

Mathematics Subject Classification ID

Related Items (2)

Modeling nanostructural surface modifications in metal cutting by an approach of thermodynamic irreversibility: derivation and experimental validation ⋮ Three-dimensional simulation of urine concentrating mechanism in a functional unit of rat outer medulla. I: Model structure and base case results

Cites Work

• Particle host cell determination in unstructured grids
• Robust, vectorized search algorithms for interpolation on unstructured grids
• An efficient and robust particle-localization algorithm for unstructured grids
• A vectorized particle tracer for unstructured grids
• Large-eddy simulation of swirling particle-laden flows in a coaxial-jet combustor
• An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids
• An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates
• An effective particle tracing scheme on structured/unstructured grids in hybrid finite volume/PDF Monte Carlo methods

This page was built for publication: A set of particle locating algorithms not requiring face belonging to cellconnectivity data