Building Space-Time Meshes over Arbitrary Spatial Domains

2002/06/01 by Jeff Erickson, Damrong Guoy, Erickson, Jeff +5 · 3 citations
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #cs.CG

paper · pdf · doi:10.48550/arxiv.cs/0206002

12 pages, 14 figures; see also http://www.cs.uiuc.edu/~jeffe/pubs/slowpitch.html

arxiv created 2002/06/01 · arxiv updated 2009/11/30

Abstract

We present an algorithm to construct meshes suitable for space-time discontinuous Galerkin finite-element methods. Our method generalizes and improves the `Tent Pitcher' algorithm of Üngör and Sheffer. Given an arbitrary simplicially meshed domain M of any dimension and a time interval [0,T], our algorithm builds a simplicial mesh of the space-time domain Mx[0,T], in constant time per element. Our algorithm avoids the limitations of previous methods by carefully adapting the durations of space-time elements to the local quality and feature size of the underlying space mesh.

Cited by

• Spacetime Meshing for Discontinuous Galerkin Methods
• Efficient Spacetime Meshing with Nonlocal Cone Constraints
• Tiling space and slabs with acute tetrahedra

Related

• Spacetime Meshing for Discontinuous Galerkin Methods
• Computing the jump-term in space-time FEM for arbitrary temporal interpolation
• Efficient Spacetime Meshing with Nonlocal Cone Constraints
• Surface and hypersurface meshing techniques for space-time finite element methods
• ideal.II: a Galerkin Space-Time Extension to the Finite Element Library deal.II