Minimum spanning trees for valley and ridge characterization in digital elevation maps


Autoria(s): Bangay, Shaun; de Bruyn, David; Glass, Kevin
Contribuinte(s)

Spencer, Stephen N.

Data(s)

01/01/2010

Resumo

Texture synthesis employs neighbourhood matching to generate appropriate new content. Terrain synthesis has the added constraint that new content must be geographically plausible. The profile recognition and polygon breaking algorithm (PPA) [Chang et al. 1998] provides a robust mechanism for characterizing terrain as systems of valley and ridge lines in digital elevation maps. We exploit this to create a terrain characterization metric that is robust, efficient to compute and is sensitive to terrain properties. <br /><br />Terrain regions are characterized as a minimum spanning tree derived from a graph created from the sample points of the elevation map which are encoded as weights in the edges of the graph. This formulation allows us to provide a single consistent feature definition that is sensitive to the pattern of ridges and valleys in the terrain Alternative formulations of these weights provide richer characteristicmeasures and we provide examples of alternate definitions based on curvature and contour measures.<br /><br />We show that the measure is robust, with a significant portion derived directly from information local to the terrain sample. Global terrain characteristics introduce the issue of over- and underconnected valley/ridge lines when working with sub-regions. This is addressed by providing two graph construction strategies, which respectively provide an upper bound on connectivity as a single spanning tree, and a lower bound as a forest of trees. <br /><br />Efficient minimum spanning tree algorithms are adapted to the context of terrain data and are shown to provide substantially better performance than previous PPA implementations. In particular, these are able to characterize valley and ridge behaviour at every point even in large elevation maps, providing a measure sensitive to terrain features at all scales.<br /><br />The resulting graph based formulation provides an efficient and elegant algorithm for characterizing terrain features. The measure can be calculated efficiently, is robust under changes of neighbourhood position, size and resolution and the hybrid measure is sensitive to terrain features both locally and globally.<br />

Identificador

http://hdl.handle.net/10536/DRO/DU:30039213

Idioma(s)

eng

Publicador

Association for Computing Machinery

Relação

http://dro.deakin.edu.au/eserv/DU:30039213/bangay-minimumspanning-2010.pdf

http://dx.doi.org/10.1145/1811158.1811171

http://www.afrigraph.org/

Direitos

2010, Association for Computing Machinery

Palavras-Chave #line #ridge #graph #minimum spanning tree #DEM
Tipo

Conference Paper