carrier image

Building Space-Time Meshes Over Arbitrary Spatial Domains

Erickson, Jeff, Damrong Guoy, John M. Sullivan and Alper Ungor

Proceedings, 11th International Meshing Roundtable, Springer-Verlag, pp.391-403, September 15-18 2002

IMR
PROCEEDINGS

11th International Meshing Roundtable
Ithaca, New York, USA.
September 15-18 2002

Jeff Erickson
Dept. of Computer Science,
Univ. of Illinois at Urbana-Champaign,
je e@cs.uiuc.edu

Damrong Guoy
Computational Science & Engineering Prog.,
Univ. of Illinois at Urbana-Champaign,
guoy@uiuc.edu

John M. Sullivan
Dept. of Mathematics,
Univ. of Illinois at Urbana-Champaign,
jms@math.uiuc.edu

Alper Ungor
Dept. of Computer Science, Duke Univ.,
ungor@cs.duke.edu

Abstract
We present an algorithm to construct meshes suitable for space-time discontinuous Galerkin nite-element methods. Our method generalizes and improves the 'Tent Pitcher' algorithm of Ungor and She er. Given an arbitrary simplicially meshed domain X of any dimension and a time interval [0; T], our algorithm builds a simplicial mesh of the space-time domain X  [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.

Download Full Paper (PDF Format)


Contact author(s) or publisher for availability and copyright information on above referenced article