Skip to main navigation Skip to search Skip to main content

Multi-triangulations as complexes of star polygons

  • CSIC-Univ. Cantabria

Research output: Contribution to conference › Paper › peer-review

Abstract

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross. k-triangulations have received attention in recent literature, with motivation coming from several interpretations of them.We present a new way of looking at k-triangulations, where certain star polygons naturally generalize triangles for k-triangulations. With this tool we give new, direct proofs of the fundamental properties of k-triangulations (number of edges, definition of flip). This interpretation also opens up new avenues of research that we briefly explore in the last section.

Original languageEnglish
Pages319-330
Number of pages12
Publication statusPublished - 1 Dec 2008
Event20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08 - Valparaiso, Chile
Duration: 23 Jun 2008 → 27 Jun 2008

Conference

Conference20th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'08
Country/TerritoryChile
CityValparaiso
Period23/06/08 → 27/06/08

Keywords

  • Crossing-free graph
  • Generalized triangulation
  • Star polygon

Fingerprint

Dive into the research topics of 'Multi-triangulations as complexes of star polygons'. Together they form a unique fingerprint.

Cite this