Book embeddings of Reeb graphs
Computational Geometry
2013-12-09 v1 Computer Vision and Pattern Recognition
Geometric Topology
Abstract
Let be a simplicial complex with a piecewise linear function . The Reeb graph is the quotient of , where we collapse each connected component of to a single point. Let the nodes of be all homologically critical points where any homology of the corresponding component of the level set changes. Then we can label every arc of with the Betti numbers of the corresponding -dimensional component of a level set. The homology labels give more information about the original complex 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