Optimal Reeb graphs on two- and three-connected planar polygon
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913309000728576 |
|---|---|
| author | Pryshliak, Oleksandr Haieva, Karolina |
| author_facet | Pryshliak, Oleksandr Haieva, Karolina |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_07193 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal Reeb graphs on two- and three-connected planar polygon Pryshliak, Oleksandr Haieva, Karolina Geometric Topology 58K05, 37D15 G.1.7 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. |
| title | Optimal Reeb graphs on two- and three-connected planar polygon |
| topic | Geometric Topology 58K05, 37D15 G.1.7 |
| url | https://arxiv.org/abs/2404.07193 |