English

Book embeddings of Reeb graphs

Computational Geometry 2013-12-09 v1 Computer Vision and Pattern Recognition Geometric Topology

Abstract

Let XX be a simplicial complex with a piecewise linear function f:XRf:X\to\mathbb{R}. The Reeb graph Reeb(f,X)Reeb(f,X) is the quotient of XX, where we collapse each connected component of f1(t)f^{-1}(t) to a single point. Let the nodes of Reeb(f,X)Reeb(f,X) be all homologically critical points where any homology of the corresponding component of the level set f1(t)f^{-1}(t) changes. Then we can label every arc of Reeb(f,X)Reeb(f,X) with the Betti numbers (β1,β2,,βd)(\beta_1,\beta_2,\dots,\beta_d) of the corresponding dd-dimensional component of a level set. The homology labels give more information about the original complex XX than the classical Reeb graph. We describe a canonical embedding of a Reeb graph into a multi-page book (a star cross a line) and give a unique linear code of this book embedding.

Keywords

Cite

@article{arxiv.1312.1725,
  title  = {Book embeddings of Reeb graphs},
  author = {Vitaliy Kurlin},
  journal= {arXiv preprint arXiv:1312.1725},
  year   = {2013}
}

Comments

12 pages, 5 figures, more examples will be at http://kurlin.org

R2 v1 2026-06-22T02:22:01.647Z