A tetrahedral space-filling curve for nonconforming adaptive meshes

From MaRDI portal
Publication:2821775




Abstract: We introduce a space-filling curve for triangular and tetrahedral red-refinement that can be computed using bitwise interleaving operations similar to the well-known Z-order or Morton curve for cubical meshes. To store sufficient information for random access, we define a low-memory encoding using 10 bytes per triangle and 14 bytes per tetrahedron. We present algorithms that compute the parent, children, and face-neighbors of a mesh element in constant time, as well as the next and previous element in the space-filling curve and whether a given element is on the boundary of the root simplex or not. Our presentation concludes with a scalability demonstration that creates and adapts selected meshes on a large distributed-memory system.



Cites work



Describes a project that uses

Uses Software





This page was built for publication: A tetrahedral space-filling curve for nonconforming adaptive meshes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821775)