Optimal Reeb graphs on two- and three-connected planar polygon
Abstract
To investigate the topological structure of planar polygon decomposition on trapezoids, which is formed by height functions. We use the oriented Reeb graph of the function with a marked vertex. We describe all possible optimal Reeb graphs in the case of polygon in general position with one local minimum and one local maximum. By optimal Reeb graph we mean Reeb graph, which cann't be obtaned from other Reeb graph by subdivision of an edge or a leaf attaching. In this case polygon is a triangle with triangle holes. Constructed Reeb graphs give topological structures of trapezoid maps on two-connected polygon with six vertexes and three-connected polygon with nine vertexes.
Keywords
Cite
@article{arxiv.2404.07193,
title = {Optimal Reeb graphs on two- and three-connected planar polygon},
author = {Oleksandr Pryshliak and Karolina Haieva},
journal= {arXiv preprint arXiv:2404.07193},
year = {2024}
}
Comments
8 pages, 5 figures. arXiv admin note: text overlap with arXiv:2303.03850 by other authors