We present an algorithm to store and process fully adaptive computational grids requiring only a minimal amount of memory. The adaptive grid is specified by a recursive decomposition of triangular grid cells; the cells are stored and processed in an order that is given by Sierpinski's space filling curve. A sophisticated system of stacks is used to ensure the efficient access to the unknowns. The resulting scheme makes it possible to process grids containing more than one hundred million cells on a common workstation, and is also inherently cache efficient. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Bader, M., & Zenger, C. (2006). Efficient storage and processing of adaptive triangular grids using sierpinski curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3991 LNCS-I, pp. 673–680). Springer Verlag. https://doi.org/10.1007/11758501_90
Mendeley helps you to discover research relevant for your work.