Spatial Indexing Package

This package is a C++ templated class library designed to support adaptive mesh refinement (AMR) for logically Cartesian, structured meshes. A heirarchy of sub-grids are stored in a tree data structure. Each node of the tree is a structured mesh with the same index ranges. In N-dimensional space, refinement replaces a single mesh with 2^N meshes; coarsening does the opposite. The application developer typically provides the following:

• A structured mesh data structured that will be stored in each node.
• An action (the solver) to apply to the nodes.
• Criteria for refinement and coarsening.

Notable features include:

• A C++ interface with standard style functors to control actions, refinement and coarsening.
• Support for any space dimension. (The dimension is a template parameter.)
• Mixed-mode concurrency (both shared-memory and distributed-memory) to effectively utilize a wide range of architectures, including clusters of multi-core processors.

This package has a linear orthree called geom::OrthtreeMap . Each leaf has an associated spatial index (implemented in geom::SpatialIndex) that encodes its level and position in the tree.

Use this sub-package by including the desired class or by including the file spatialIndexing.h.

Follow the links below for documentation and results.

• Introduction
• Orthant Arithmetic
• The Spatial Index
• The Node Container
• Concurrency
• Examples
• Performance
• Links