Graph families | Application-specific graphs
Reeb graph
A Reeb graph (named after Georges Reeb by René Thom) is a mathematical object reflecting the evolution of the level sets of a real-valued function on a manifold.According to a similar concept was introduced by G.M. Adelson-Velskii and A.S. Kronrod and applied to analysis of Hilbert's thirteenth problem. Proposed by G. Reeb as a tool in Morse theory, Reeb graphs are the natural tool to study multivalued functional relationships between 2D scalar fields , , and arising from the conditions and , because these relationships are single-valued when restricted to a region associated with an individual edge of the Reeb graph. This general principle was first used to study neutral surfaces in oceanography. Reeb graphs have also found a wide variety of applications in computational geometry and computer graphics, including computer aided geometric design, topology-based , topological data analysis, topological simplification and cleaning, surface segmentation and parametrization, efficient computation of level sets, neuroscience, and geometrical thermodynamics.In a special case of a function on a flat space (technically a simply connected domain), the Reeb graph forms a polytree and is also called a contour tree. Level set graphs help statistical inference related to estimating probability density functions and regression functions, and they can be used in cluster analysis and function optimization, among other things. (Wikipedia).
