Graph of triangulations of a convex polygon and tree of triangulations
From MaRDI portal
Publication:1961385
DOI10.1016/S0925-7721(99)00016-4zbMath0948.68127OpenAlexW1983134817WikidataQ126550469 ScholiaQ126550469MaRDI QIDQ1961385
Publication date: 13 November 2000
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00016-4
Related Items
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations, Enumeration of bipartite non-crossing geometric graphs, On the rotation distance between binary trees, SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS, Unnamed Item, A direct algorithm for restricted rotation distance, An efficient algorithm for estimating rotation distance between two binary trees, Decomposition of Catalan numbers and convex polygon triangulations, Compatibility fans for graphical nested complexes, New production matrices for geometric graphs, Hyperideal polyhedra in the 3-dimensional anti-de Sitter space, Characteristic polynomials of production matrices for geometric graphs, The Mathematics of Ferran Hurtado: A Brief Survey, Celebrating Loday's associahedron, An improved kernel for the flip distance problem on simple convex polygons, On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials, Blockers for triangulations of a convex polygon and a geometric maker-breaker game, On local transformations in plane geometric graphs embedded on small grids, Gray code enumeration of plane straight-line graphs, Orbiting triangle method for convex polygon triangulation, Flips in planar graphs, Production matrices for geometric graphs, Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex, The rotation graph of \(k\)-ary trees is Hamiltonian, Flip Algorithm for Segment Triangulations, Generating All Triangulations of Plane Graphs (Extended Abstract), Once punctured disks, non-convex polygons, and pointihedra, New results on production matrices for geometric graphs, Rainbow Cycles in Flip Graphs, On flips in planar matchings, Combinatorial generation via permutation languages. II. Lattice congruences, AN ALTERNATIVE DECOMPOSITION OF CATALAN NUMBER, Gray codes for non-crossing partitions and dissections of a convex polygon, An improved kernel size for rotation distance in binary trees, Rainbow Cycles in Flip Graphs., A new lower bound on the maximum number of plane graphs using production matrices, Graphs of triangulations and perfect matchings, On local transformation of polygons with visibility properties., An efficient algorithm for enumeration of triangulations
