The presented acceleration techniques do not need the LS values of all points in the grid. Hence, it is sufficient to store only the LS values of all defined grid points. The set of defined grid points is the union of all active grid points plus those of neighboring grid points which are needed to construct the finite differences as required by the update scheme. In the following, an overview of efficient data structures for storing the discretized LS function is presented.

- 3.5.1 Trees
- 3.5.2 Run-Length Encoding
- 3.5.3 Dynamic Tubular Grid
- 3.5.4 Hierarchical Run-Length Encoding

Otmar Ertl: Numerical Methods for Topography Simulation