Counting Triangulations of Fixed Cardinal Degrees
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909826990211072 |
|---|---|
| author | Chambers, Erin Ophelders, Tim Schenfisch, Anna Sollberger, Julia |
| author_facet | Chambers, Erin Ophelders, Tim Schenfisch, Anna Sollberger, Julia |
| contents | A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if we know, for each vertex, the number of neighbors in each of the four cardinal directions, the triangulation is not completely determined. In fact, we show that counting such triangulations is #P-hard via a reduction from #3-regular bipartite planar vertex cover. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_04870 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Counting Triangulations of Fixed Cardinal Degrees Chambers, Erin Ophelders, Tim Schenfisch, Anna Sollberger, Julia Computational Complexity Computational Geometry A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if we know, for each vertex, the number of neighbors in each of the four cardinal directions, the triangulation is not completely determined. In fact, we show that counting such triangulations is #P-hard via a reduction from #3-regular bipartite planar vertex cover. |
| title | Counting Triangulations of Fixed Cardinal Degrees |
| topic | Computational Complexity Computational Geometry |
| url | https://arxiv.org/abs/2510.04870 |