@inproceedings{9ec2decdbb174f539270600ebdbd85d7,
title = "Efficient storage and processing of adaptive triangular grids using sierpinski curves",
abstract = "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.",
author = "M. Bader and Ch Zenger",
year = "2006",
doi = "10.1007/11758501\_90",
language = "English",
isbn = "3540343792",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "673--680",
booktitle = "Computational Science - ICCS 2006",
note = "ICCS 2006: 6th International Conference on Computational Science ; Conference date: 28-05-2006 Through 31-05-2006",
}