For an easy sequential access to LS values of grid points stored within a H-RLE data structure iterators have been developed. These iterators can be moved over the data structure in linear time with respect to the number of defined grid points. They are the basis for the realization of algorithms such as the sparse field LS method with optimal linear scaling.

Otmar Ertl: Numerical Methods for Topography Simulation