A particle localization algorithm on unstructured curvilinear polynomial meshes
From MaRDI portal
Publication:6101940
DOI10.1016/j.cpc.2018.09.024WikidataQ129159530 ScholiaQ129159530MaRDI QIDQ6101940
Stephen M. Copplestone, Wladimir Reschke, Philip Ortwein, Stefanos Fasoulas, Claus-Dieter Munz, Tilman Binder
Publication date: 5 May 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Related Items (2)
Development of a particle collision algorithm for discontinuous Galerkin simulations of compressible multiphase flows ⋮ A framework for high-fidelity particle tracking on massively parallel systems
Cites Work
- Unnamed Item
- Unnamed Item
- A grid-independent particle pairing strategy for DSMC
- Curve intersection using Bézier clipping
- Algorithms for interpolation and localization in irregular 2D meshes
- Localization schemes in 2D boundary-fitted grids
- A generalized particle search-locate algorithm for arbitrary grids
- Ray tracing of spline surfaces: Bézier clipping, Chebyshev boxing, and bounding volume hierarchy - a critical comparison with new results
- Towards efficient tracking of inertial particles with high-order multidomain methods
- An efficient and robust particle-localization algorithm for unstructured grids
- A charge- and energy-conserving implicit, electrostatic particle-in-cell algorithm on mapped computational meshes
- High-order nodal discontinuous Galerkin particle-in-cell method on unstructured grids
- Algebraic Mesh Quality Metrics
- Particle tracking in unstructured, arbitrary polyhedral meshes for use in CFD and molecular dynamics
- An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids
This page was built for publication: A particle localization algorithm on unstructured curvilinear polynomial meshes