Flips in colorful triangulations
The associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation. A flip removes an edge shared by two triangles and replaces it by the other diagonal of the resulting 4-gon. In this p...
Zapisane w:
| Główni autorzy: | , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
Carleton University
2025-05-01
|
| Seria: | Journal of Computational Geometry |
| Dostęp online: | https://jocg.org/index.php/jocg/article/view/4982 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|