Engineering with Computers 20(4):342–353, 2005.
Proceedings of the 11th International Meshing Roundtable, 391-402, 2002.
We present an algorithm to construct meshes suitable for spacetime 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 X of any dimension and a time interval [0,T], our algorithm builds a simplicial mesh of the spacetime domain X×[0,T], in constant time per element. Our algorithm avoids the limitations of previous methods by carefully adapting the durations of spacetime elements to the local quality and feature size of the underlying space mesh.