任意空间域上时空网格的构建
Building Space-Time Meshes over Arbitrary Spatial Domains
摘要：
提出了一种适用于时空间断伽辽金有限元法的网格构造算法。我们的方法推广和改进了Üngör和Sheffer的“帐篷投手”算法。给定一个任意维数的任意单纯网格域M和时间间隔[0，T]，我们的算法在每个元素的恒定时间内建立时空域Mx[0，T]的单纯网格。我们的算法避免了以前的方法的局限性，通过仔细调整时空元素的持续时间的本地质量和特征大小的基础空间网格。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
