Building Space-Time Meshes over Arbitrary Spatial Domains

Details Building Space-Time Meshes over Arbitrary Spatial Domains Building Space-Time Meshes over Arbitrary Spatial Domains

2002-06-01

arxiv.org/abs/cs/0206002v1

Computer Science

Computational Geometry

12 pages, 14 figures; see also http://www.cs.uiuc.edu/~jeffe/pubs/slowpitch.html

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Building Space-Time Meshes over Arbitrary Spatial Domains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Building Space-Time Meshes over Arbitrary Spatial Domains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Building Space-Time Meshes over Arbitrary Spatial Domains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619808