Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Two-Dimensional Critical Point Configuration Graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lee, R. Nackman ; 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.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:PAMI-6 ,  Issue: 4 )