Efficient Storage and Processing of Adaptive Triangular Grids Using Sierpinski Curves

DOI10.1007/11758501_90zbMath1155.65402OpenAlexW1491000885MaRDI QIDQ3545058

No author found.

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)

Related Items (3)

Coarse Mesh Partitioning for Tree-Based AMR ⋮ No acute tetrahedron is an 8-reptile ⋮ 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