A tetrahedral space-filling curve for non-conforming adaptive meshes

Autor:	Burstedde, Carsten, Holke, Johannes
Rok vydání:	2015
Předmět:	Computer Science - Distributed Parallel and Cluster Computing Computer Science - Mathematical Software 65M50 68W10 65Y05 65D18
Druh dokumentu:	Working Paper
DOI:	10.1137/15M1040049
Popis:	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. Comment: 33 pages, 12 figures, 8 tables
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1509.04627 Zobrazit plný text záznamu View this record from Arxiv