Building Space-Time Meshes over Arbitrary Spatial Domains

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
12 pages, 14 figures; see also http://www.cs.uiuc.edu/~jeffe/pubs/slowpitch.html

Keywords

Computational Geometry, F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31130

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0206002
 http://arxiv.org/abs/cs/0206002

Collections

arXiv