Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves

DOI10.1007/11758501_90MaRDI QIDQ3545058zbMATH OpenOpenAlexFDO

Authors

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_90

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99)

Recommendations

• Dynamically adaptive simulations with minimal memory requirement-solving the shallow water equations using Sierpiński curves
• A tetrahedral space-filling curve for nonconforming adaptive meshes
• Peano -- a traversal and storage scheme for octree-like adaptive Cartesian multiscale grids
• A cache‐oblivious self‐adaptive full multigrid method
• A Cache‐Aware Algorithm for PDEs on Hierarchical Data Structures Based on Space‐Filling Curves

Cited in

(6)

• No acute tetrahedron is an 8-reptile
• A tetrahedral space-filling curve for nonconforming adaptive meshes
• Dynamically adaptive simulations with minimal memory requirement-solving the shallow water equations using Sierpiński curves
• Peano -- a traversal and storage scheme for octree-like adaptive Cartesian multiscale grids
• Coarse mesh partitioning for tree-based AMR
• Reptilings and space-filling curves for acute triangles

This page was built for publication: Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves

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