A generalization of diagonal flips in a convex polygon
From MaRDI portal
Publication:1978713
DOI10.1016/S0304-3975(99)00199-1zbMath0938.68880MaRDI QIDQ1978713
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (18)
Posets and Spaces of $k$-Noncrossing RNA Structures ⋮ Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings ⋮ Brick polytopes, lattice quotients, and Hopf algebras ⋮ Symmetries of statistics on lattice paths between two boundaries ⋮ The brick polytope of a sorting network ⋮ Celebrating Loday's associahedron ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Subword complexes, cluster complexes, and generalized multi-associahedra ⋮ Beyond Outerplanarity ⋮ A bijection between 2-triangulations and pairs of non-crossing Dyck paths ⋮ The diameter of type \(D\) associahedra and the non-leaving-face property ⋮ Fan Realizations for Some 2-Associahedra ⋮ A new perspective on \(k\)-triangulations ⋮ The size of 3-compatible, weakly compatible split systems ⋮ Maximal planar graphs of inscribable type and diagonal flips ⋮ Multitriangulations as complexes of star polygons ⋮ Type-B generalized triangulations and determinantal ideals ⋮ Quasi-planar Graphs
Cites Work
This page was built for publication: A generalization of diagonal flips in a convex polygon