Building Space-Time Meshes over Arbitrary Spatial Domains
Computational Geometry
2007-05-23 v1
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 \"Ung\"or 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.
Cite
@article{arxiv.cs/0206002,
title = {Building Space-Time Meshes over Arbitrary Spatial Domains},
author = {Jeff Erickson and Damrong Guoy and John M. Sullivan and Alper Üngör},
journal= {arXiv preprint arXiv:cs/0206002},
year = {2007}
}
Comments
12 pages, 14 figures; see also http://www.cs.uiuc.edu/~jeffe/pubs/slowpitch.html