Building Space-Time Meshes over Arbitrary Spatial Domains
| dc.creator | Erickson, Jeff | |
| dc.creator | Guoy, Damrong | |
| dc.creator | Sullivan, John M. | |
| dc.creator | Üngör, Alper | |
| dc.date | 2002-06-01 | |
| dc.date.accessioned | 2026-07-07T03:18:29Z | |
| dc.date.available | 2026-07-07T03:18:29Z | |
| dc.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. | |
| dc.description | 12 pages, 14 figures; see also http://www.cs.uiuc.edu/~jeffe/pubs/slowpitch.html | |
| dc.identifier | https://arxiv.org/abs/cs/0206002 | |
| dc.identifier | http://arxiv.org/abs/cs/0206002 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31130 | |
| dc.subject | Computational Geometry | |
| dc.subject | F.2.2 | |
| dc.title | Building Space-Time Meshes over Arbitrary Spatial Domains | |
| dc.type | text |