An exact general remeshing scheme applied to physically conservative voxelization
DOI10.1016/J.JCP.2015.05.022zbMATH Open1349.65084arXiv1412.4941OpenAlexW2118953463MaRDI QIDQ350168FDOQ350168
Authors: Devon Powell, Tom Abel
Publication date: 5 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4941
Recommendations
- Conservative remapping and region overlays by intersecting arbitrary polyhedra
- Volume conserving smoothing for piecewise linear curves, surfaces, and triple lines
- scientific article; zbMATH DE number 5239222
- An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes
- High order accurate conservative remapping scheme on polygonal meshes using \textit{a posteriori} MOOD limiting
Numerical integration (65D30) Numerical interpolation (65D05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Analytical and geometrical tools for 3D volume of fluid methods in general grids
- RAMSES
- Volume of fluid (VOF) method for the dynamics of free boundaries
- Lagrangian-Eulerian finite element formulation for incompressible viscous flows
- Title not available (Why is that?)
- Accurate Conservative Remapping (Rezoning) for Arbitrary Lagrangian-Eulerian Computations
- Reale: a Reconnection-based Arbitrary-Lagrangian-Eulerian method
- Numerical simulation of moving contact line problems using a volume-of-fluid method
- An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Conservative remapping and region overlays by intersecting arbitrary polyhedra
- Exact integrations of polynomials and symmetric quadrature formulas over arbitrary polyhedral grids
- Second-order sign-preserving conservative interpolation (remapping) on general grids
- On finite element integration in natural co-ordinates
- Reentrant polygon clipping
- Exact formulae for areas, volumes and moments of polygons and polyhedra
- Title not available (Why is that?)
- Generalizing the Formula for Areas of Polygons to Moments
- LOCAL ROBUSTNESS AND ITS APPLICATION TO POLYHEDRAL INTERSECTION
- Two design principles of geometric algorithms in finite-precision arithmetic
Cited In (19)
- A high order positivity-preserving conservative WENO remapping method on 3D tetrahedral meshes
- Non-convex analytical and geometrical tools for volume truncation, initialization and conservation enforcement in VOF methods
- A contact algorithm for voxel-based meshes using an implicit boundary representation
- Tetrahedral mesh adaptation for Lagrangian shock hydrodynamics
- A high order positivity-preserving polynomial projection remapping method
- A high order positivity-preserving conservative WENO remapping method on 2D quadrilateral meshes
- A localized subdomain smoothing MMALE particle method for efficient modeling FSI problems
- Simplex-in-cell technique for collisionless plasma simulations
- Conservative remapping of material-dependent fields between possibly misaligned material regions
- Motion Planning Under Uncertainty with Complex Agents and Environments via Hybrid Search
- High order accurate conservative remapping scheme on polygonal meshes using \textit{a posteriori} MOOD limiting
- Multi-material swept face remapping on polyhedral meshes
- A robust and efficient polyhedron subdivision and intersection algorithm for three-dimensional MMALE remapping
- Compatible and energy conserving multi-material arbitrary Lagrangian Eulerian scheme for multi-group radiation hydrodynamics simulations
- Geometrical discretisations for unfitted finite elements on explicit boundary representations
- Synchronous and concurrent multidomain computing method for cloud computing platforms
- General, robust, and efficient polyhedron intersection in the interface reconstruction library
- An indirect ALE discretization of single fluid plasma without a fast magnetosonic time step restriction
- Intercode hexahedral meshing from Eulerian to Lagrangian simulations
Uses Software
This page was built for publication: An exact general remeshing scheme applied to physically conservative voxelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350168)