An Algorithm of the Constrained Construction for Terrain Morse Complexes

The correct connection of the topological relationships between critical points (or lines) is the basis of the earth’s surface description, terrain topological simplification, or geomorphic generalization of relief. However, the intersection of valley and ridge line at regular points often occurs in the existing algorithms of constructing terrain Morse complexes. In this paper, a novel universal algorithm of the constrained construction for terrain Morse complexes is presented. In our approach, the separatrix of descending (or ascending) Morse complex is regarded as the constrained boundary of extracting the separatrix of the dual Morse complex, and the terrain feature line starting from end (or start) saddle coincides exactly with the “macro-saddle line”. As a result, the intersections are prevented absolutely and the macro-saddles can be identified to achieve complete decomposition of the whole terrain surface. In the end, an experiment is done to validate the correctness and feasibility of this algorithm.

[1]  Emanuele Danovaro,et al.  A Discrete Approach to Compute Terrain Morphology , 2007, VISIGRAPP.

[2]  Tosiyasu L. Kunii,et al.  Algorithms for Extracting Correct Critical Points and Constructing Topological Graphs from Discrete Geographical Elevation Data , 1995, Comput. Graph. Forum.

[3]  B. Schneider Extraction of Hierarchical Surface Networks from Bilinear Surface Patches , 2005 .

[4]  Emanuele Danovaro,et al.  Multi-scale dual morse complexes for representing terrain morphology , 2007, GIS.

[5]  Emanuele Danovaro,et al.  Topological Analysis and Characterization of Discrete Scalar Fields , 2002, Theoretical Foundations of Computer Vision.

[6]  B. Schneider,et al.  Construction of Metric Surface Networks from Raster‐Based DEMs , 2006 .

[7]  Valerio Pascucci Topology Diagrams of Scalar Fields in Scientific Visualisation , 2006 .

[8]  Chandrajit L. Bajaj,et al.  Topology preserving data simplification with error bounds , 1998, Comput. Graph..

[9]  Leila De Floriani,et al.  Modeling and Generalization of Discrete Morse Terrain Decompositions , 2010, 2010 20th International Conference on Pattern Recognition.

[10]  Wolfgang Strasser,et al.  Extracting regions of interest applying a local watershed transformation , 2000 .

[11]  Herbert Edelsbrunner,et al.  Hierarchical morse complexes for piecewise linear 2-manifolds , 2001, SCG '01.

[12]  Reinhard Klette,et al.  Geometry, Morphology, and Computational Imaging , 2003 .

[13]  Leila De Floriani,et al.  Morse-Smale Decompositions for Modeling Terrain Knowledge , 2005, COSIT.

[14]  Alina N. Moga,et al.  A connected component approach to the watershed segmentation , 1998 .

[15]  B. Hamann,et al.  A multi-resolution data structure for two-dimensional Morse-Smale functions , 2003, IEEE Visualization, 2003. VIS 2003..

[16]  Stephan Winter,et al.  Spatial Information Theory, 8th International Conference, COSIT 2007, Melbourne, Australia, September 19-23, 2007, Proceedings , 2007, COSIT.

[17]  S. Smale Morse inequalities for a dynamical system , 1960 .