Conservative remapping and region overlays by intersecting arbitrary polyhedra
DOI10.1006/jcph.1998.6125zbMath0932.76073MaRDI QIDQ1282428
Publication date: 8 March 2000
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcph.1998.6125
parallel implementation; computational geometry; polyhedral meshes; rezoning; domain decomposed mesh; first-order grid intersections; first-order remapping; hydrodynamics simulations
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
65M50: Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
76M99: Basic methods in fluid mechanics
Related Items
Uses Software
Cites Work
- Unnamed Item
- A high-order projection method for tracking fluid interfaces in variable density incompressible flows
- Conservative rezoning (remapping) for general quadrilateral meshes
- Conservative rezoning algorithm for generalized two-dimensional meshes
- An algorithm for the discrete rezoning of Lagrangian meshes
- Towards the ultimate conservative difference scheme. V. A second-order sequel to Godunov's method
- Numerical solution of the quasilinear Poisson equation in a nonuniform triangle mesh
- Accurate Conservative Remapping (Rezoning) for Arbitrary Lagrangian-Eulerian Computations
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra