CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 1984 vol.6 Issue No.04 - April
Issue No.04 - April (1984 vol.6)
R. Nackman Lee , IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598.
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.
R. Nackman Lee, "Two-Dimensional Critical Point Configuration Graphs", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.6, no. 4, pp. 442-450, April 1984, doi:10.1109/TPAMI.1984.4767549