In graph theory , a Reeb graph of some function describes the connectedness of the level surfaces of this function. Introduced by George Ribs [1]
Content
Definition
Consider a continuous function defined on a compact manifold , . Prototype of a point is a function level surface . Two points are called equivalent if they belong to the same connected component of the level surface .
Riba count function Is a factor space of diversity by such an equivalence relation , . The vertices of the graph are the connected components of the critical levels of the function. Graph orientation determined by the direction of the gradient of the function .
Properties
The following properties of Count Reeb were proved in his fundamental work [1] :
Let on compact -dimensional variety of smoothness class a Morse function f is given , all critical points of which correspond to different critical values of the function. The set of such functions is open and dense in the space of all functions. We denote Rib's graph of this function. Then:
- Vertices of degree 1 of the graph the critical points of the function f of index 0 and n correspond exactly.
- If a , the vertex of the graph corresponding to the critical level of the function f , which contains the critical point of index 1 and n-1 , can have degree 2 or 3 .
- If a , the vertices of the graph corresponding to the critical points of index 1 can have degree 2 , 3, or 4 .
- The degree of the vertex of the graph corresponding to the critical level of the function f , which contains the critical point of the index other than 0 , 1 , n-1 and n , is always 2 .
These graph properties entail the curious property of Morse functions, proved there [1] :
- Denote by the set of critical points of the index function k and nk . If a then .
Application
Reeb graphs are used in mathematics when studying
- topological classification of Morse functions [2]
- Hamiltonian systems [3]
RIBA graphs and, in particular, RIBA acyclic graphs, called contour trees , are widely used in computer applications:
- in computer design and geometric modeling,
- in geometric models of data structures and database search methods
- in automation systems for design work .
Notes
- ↑ 1 2 3 G. Reeb , Sur les points singuliers d'une forme de Pfaff complétement intégrable ou d'une fonction numérique. - CRAS Paris 222, 1946, pp. 847-849. [one]
- ↑ Sharko V.V. Smooth and topological equivalence of functions on surfaces. // Ukrainian Mathematical Journal. 2003. V. 55. No. 5. P. 687-700.
- ↑ A. V. Bolsinov, A. T. Fomenko, Introduction to the topology of integrable Hamiltonian systems, Nauka, Moscow, 1997.