Bader, Michael and Weinzierl, Tobias (2015) 'Cache-oblivious spacetree traversals.', in Encyclopedia of algorithms. Berlin, Heidelberg: Springer, pp. 1-6.
In scientific computing and related fields, mathematical functions are often approximated on meshes where each mesh cell contains a local approximation (e.g., using polynomials) of the represented quantity (density functions, physical quantities such as temperature or pressure, etc.). The grid cells may adaptively refine within areas of high interest or where the applied numerical algorithms demand improved resolution. The resolution even may dynamically change throughout the computation. In this context, we consider tree-structured adaptive meshes, i.e., meshes that result from a recursive subdivision of grid cells. They can be represented via trees – quadtrees or octrees being the most prominent examples. In typical problem settings, quantities are stored on entities (vertices, edges, faces, cells) of the grid. The computation of these variables is usually characterized by local interaction rules and involves variables of adjacent grid cells only.
|Item Type:||Book chapter|
|Keywords:||Space-filling curves, Tree-structured grids, Octree, Quadtree, Spacetree, Grid traversals, Cache-oblivious algorithms.|
|Full text:||Publisher-imposed embargo |
(AM) Accepted Manuscript
File format - PDF (Copyright agreement prohibits open access to the full-text) (218Kb)
|Publisher Web site:||http://dx.doi.org/10.1007/978-3-642-27848-8_583-1|
|Date accepted:||No date available|
|Date deposited:||12 October 2015|
|Date of first online publication:||22 June 2015|
|Date first made open access:||No date available|
Save or Share this output
|Look up in GoogleScholar|