{
  "aliases": [
    "contour-tree"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nA **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|0EPAT51DXQ]] on a manifold. 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 $\\psi$, $\\lambda$, and $\\phi$ arising from the conditions $\\nabla \\psi = \\lambda \\nabla \\phi$ and $\\lambda \\neq 0$, 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.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "contour-tree"
    ],
    "inventory": [
      "4XY3B3BT74"
    ],
    "kind": "concept",
    "name": "Reeb graph",
    "same_as": {
      "wikidata": "Q2136464",
      "wikipedia": "Reeb graph"
    },
    "sources": [
      {
        "locator": "Reeb graph",
        "mention": "wikipedia://en/24126396",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:24126396@r1331228196"
      }
    ],
    "tag": "2HHC2MHQPX"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/2HHC2MHQPX/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/2HHC2MHQPX.md",
  "msc": null,
  "name": "Reeb graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/2HH/2HHC2MHQPX.md",
  "status": null,
  "tag": "2HHC2MHQPX",
  "uri": "m2://2HHC2MHQPX",
  "url": "https://math2.tamnd.com/wiki/reeb-graph/",
  "writing": {
    "tag": "2HHC2MHQPX",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}