skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: An exact general remeshing scheme applied to physically conservative voxelization

Journal Article · · Journal of Computational Physics

We present an exact general remeshing scheme to compute analytic integrals of polynomial functions over the intersections between convex polyhedral cells of old and new meshes. In physics applications this allows one to ensure global mass, momentum, and energy conservation while applying higher-order polynomial interpolation. We elaborate on applications of our algorithm arising in the analysis of cosmological N-body data, computer graphics, and continuum mechanics problems. We focus on the particular case of remeshing tetrahedral cells onto a Cartesian grid such that the volume integral of the polynomial density function given on the input mesh is guaranteed to equal the corresponding integral over the output mesh. We refer to this as “physically conservative voxelization.” At the core of our method is an algorithm for intersecting two convex polyhedra by successively clipping one against the faces of the other. This algorithm is an implementation of the ideas presented abstractly by Sugihara [48], who suggests using the planar graph representations of convex polyhedra to ensure topological consistency of the output. This makes our implementation robust to geometric degeneracy in the input. We employ a simplicial decomposition to calculate moment integrals up to quadratic order over the resulting intersection domain. We also address practical issues arising in a software implementation, including numerical stability in geometric calculations, management of cancellation errors, and extension to two dimensions. In a comparison to recent work, we show substantial performance gains. We provide a C implementation intended to be a fast, accurate, and robust tool for geometric calculations on polyhedral mesh elements.

Research Organization:
SLAC National Accelerator Laboratory (SLAC), Menlo Park, CA (United States)
Sponsoring Organization:
USDOE Office of Science (SC); Stanford SGF
Grant/Contract Number:
AC02-76SF00515; DE-AC02-76SF00515
OSTI ID:
1228391
Alternate ID(s):
OSTI ID: 1183695
Report Number(s):
SLAC-PUB-16295; S0021999115003563; PII: S0021999115003563
Journal Information:
Journal of Computational Physics, Journal Name: Journal of Computational Physics Vol. 297 Journal Issue: C; ISSN 0021-9991
Publisher:
ElsevierCopyright Statement
Country of Publication:
United States
Language:
English
Citation Metrics:
Cited by: 32 works
Citation information provided by
Web of Science

References (38)

E pur si muove: Galilean-invariant cosmological hydrodynamical simulations on a moving mesh journal January 2010
Generalizing the Formula for Areas of Polygons to Moments journal February 1989
Conservative voxelization journal June 2007
Accurate Conservative Remapping (Rezoning) for Arbitrary Lagrangian-Eulerian Computations journal May 1987
A Novel Approach to Visualizing Dark Matter Simulations journal December 2012
Enzo: an Adaptive mesh Refinement code for Astrophysics journal March 2014
Two design principles of geometric algorithms in finite-precision arithmetic journal January 1989
The Universe at extreme scale: Multi-petaflop sky simulation on the BG/Q
  • Habib, Salman; Morozov, Vitali; Finkel, Hal
  • 2012 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1109/SC.2012.106
conference November 2012
Exact Integrations of Polynomials and Symmetric Quadrature Formulas over Arbitrary Polyhedral Grids journal February 1998
A new approach to simulating collisionless dark matter fluids journal July 2013
Analytical and geometrical tools for 3D volume of fluid methods in general grids journal June 2008
Cosmological hydrodynamics with adaptive mesh refinement: A new high resolution code called RAMSES journal April 2002
Second-order sign-preserving conservative interpolation (remapping) on general grids journal January 2003
Lagrangian-Eulerian finite element formulation for incompressible viscous flows journal December 1981
Exact formulae for areas, volumes and moments of polygons and polyhedra journal November 1988
ReALE: A reconnection-based arbitrary-Lagrangian–Eulerian method journal June 2010
Analytic Anti-Aliasing of Linear Functions on Polytopes journal May 2012
Numerical Simulation of Moving Contact Line Problems Using a Volume-of-Fluid Method journal July 2001
zobov: a parameter-free void-finding algorithm journal June 2008
A polyhedron clipping and capping algorithm and a display system for three dimensional finite element models journal September 1975
A Mnemonic for Areas of Polygons journal June 1986
Volume of fluid (VOF) method for the dynamics of free boundaries journal January 1981
A hidden-surface algorithm with anti-aliasing journal August 1978
Fast and Accurate Computation of Polyhedral Mass Properties journal January 1996
Local Robustness and its Application to Polyhedral Intersection journal March 1994
2HOT: an improved parallel hashed oct-tree n-body algorithm for cosmological simulation conference January 2013
The cosmological simulation code gadget-2 journal December 2005
An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes journal February 2007
An adaptively refined phase–space element method for cosmological simulations and collisionless dynamics journal November 2015
Tracing the dark matter sheet in phase space: Tracing the dark matter sheet journal October 2012
A Robust and Consistent Algorithm for Intersecting Convex Polyhedra journal August 1994
Conservative Remapping and Region Overlays by Intersecting Arbitrary Polyhedra journal January 1999
Towards noiseless gravitational lensing simulations journal September 2014
Adaptive Refinement Tree: A New High‐Resolution N ‐Body Code for Cosmological Simulations
  • Kravtsov, Andrey V.; Klypin, Anatoly A.; Khokhlov, Alexei M.
  • The Astrophysical Journal Supplement Series, Vol. 111, Issue 1 https://doi.org/10.1086/313015
journal July 1997
Monotonicity in high-order curvilinear finite element arbitrary Lagrangian-Eulerian remap: MONOTONICITY IN HIGH-ORDER CURVILINEAR FINITE ELEMENT ALE REMAP journal October 2014
Reentrant polygon clipping journal January 1974
On finite element integration in natural co-ordinates journal January 1973
Nyx: A MASSIVELY PARALLEL AMR CODE FOR COMPUTATIONAL COSMOLOGY journal February 2013

Similar Records

Surface Remeshing with Robust High-Order Reconstruction
Journal Article · Wed Mar 26 00:00:00 EDT 2014 · Engineering with Computers: An International Journal of Simulation-based Engineering, 30(4):487-502 · OSTI ID:1228391

Electrostatic fields without singularities: Theory and algorithms
Conference · Tue Dec 31 00:00:00 EST 1996 · OSTI ID:1228391

Conservative remapping and region overlays by intersecting arbitrary polyhedra
Journal Article · Wed Jan 20 00:00:00 EST 1999 · Journal of Computational Physics · OSTI ID:1228391