In this section we introduce Reeb graphs.

The previous two lemmata imply that \(\mathcal{R}\) is an endofunctor on the category of \(\overline{{\mathbb{R}}}\)-spaces. Later we will define an interleaving distance on Reeb graphs, but first we will introduce join trees and their interleavings. Join trees are easier to understand and may provide us with some intuition for understanding the more sophisticated interleavings of Reeb graphs.



[2] see for example (Bredon 1993, definition I.13.1)