Reeb graphs for shape analysis and applications
Theoretical Computer Science
Morse-Smale decompositions for modeling terrain knowledge
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
Fundamenta Informaticae
| Hi-index | 0.14 |
The configuration of the critical points of a smooth function of two variables is studied under the assumption that the function is Morse, that is, that all of its critical points are nondegenerate. A critical point configuration graph (CPCG) is derived from the critical points, ridge lines, and course lines of the function. Then a result from the theory of critical points of Morse functions is applied to obtain several constraints on the number and type of critical points that appear on cycles of a CPCG. These constraints yield a catalog of equivalent CPCG cycles containing four entries. The slope districts induced by a critical point configuration graph appear useful for describing the behavior of smooth functions of two variables, such as surfaces, images, and the radius function of three-dimensional symmetric axes.