A particle localization algorithm on unstructured curvilinear polynomial meshes
From MaRDI portal
Publication:6101940
Cites work
- scientific article; zbMATH DE number 981250 (Why is no real title available?)
- scientific article; zbMATH DE number 1343226 (Why is no real title available?)
- A charge- and energy-conserving implicit, electrostatic particle-in-cell algorithm on mapped computational meshes
- A generalized particle search-locate algorithm for arbitrary grids
- A grid-independent particle pairing strategy for DSMC
- Algebraic mesh quality metrics
- Algorithms for interpolation and localization in irregular 2D meshes
- An efficient and robust particle-localization algorithm for unstructured grids
- An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids
- Curve intersection using Bézier clipping
- High-order nodal discontinuous Galerkin particle-in-cell method on unstructured grids
- Localization schemes in 2D boundary-fitted grids
- Particle tracking in unstructured, arbitrary polyhedral meshes for use in CFD and molecular dynamics
- 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
Cited in
(4)- Development of a particle collision algorithm for discontinuous Galerkin simulations of compressible multiphase flows
- A set of particle locating algorithms not requiring face belonging to cellconnectivity data
- A framework for high-fidelity particle tracking on massively parallel systems
- An efficient and robust particle-localization algorithm for unstructured grids
This page was built for publication: A particle localization algorithm on unstructured curvilinear polynomial meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101940)
