4 citations · 4 across the 3 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CG2016
Arc diagrams, flip distances, and Hamiltonian triangulations
Jean Cardinal, Michael Hoffmann, Vincent Kusters +2
We show that every triangulation (maximal planar graph) on vertices can be flipped into a Hamiltonian triangulation using a sequence of less than combinatorial edge…
cs.CG2016
Counting and Enumerating Crossing-free Geometric Graphs
Manuel Wettstein
We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, w…
cs.CG2016
Trapezoidal Diagrams, Upward Triangulations, and Prime Catalan Numbers
Manuel Wettstein
The d-dimensional Catalan numbers form a well-known sequence of numbers which count balanced bracket expressions over an alphabet of size d. In this paper, we introduce and study w…