Building Space-Time Meshes over Arbitrary Spatial Domains
<|reference_start|>Building Space-Time Meshes over Arbitrary Spatial Domains: 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.<|reference_end|>
@article{erickson2002building,
    title={Building Space-Time Meshes over Arbitrary Spatial Domains},
    author={Jeff Erickson, Damrong Guoy, John M. Sullivan, and Alper "Ung"or},
    journal={arXiv preprint arXiv:cs/0206002},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0206002},
    primaryClass={cs.CG}
}