Rotation Distance, Triangulations, and Hyperbolic Geometry
From MaRDI portal
Publication:3799259
DOI10.2307/1990951zbMath0653.51017OpenAlexW4231033470WikidataQ56067257 ScholiaQ56067257MaRDI QIDQ3799259
No author found.
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/1990951
Trees (05C05) Hyperbolic and elliptic geometries (general) and generalizations (51M10) Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Related Items
Simultaneous flips on triangulated surfaces, Two shortest path metrics on well-formed parentheses strings, A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations, The asymptotic diameter of cyclohedra, Dissecting the circle, at random, The Markovian hyperbolic triangulation, The pruning-grafting lattice of binary trees, Efficient lower and upper bounds of the diagonal-flip distance between triangulations, The geometry of graphs and some of its algorithmic applications, \(k\)-restricted rotation distance between binary trees, On the rotation distance between binary trees, Flip graphs of bounded degree triangulations, Combinatorial flip actions and Gelfand pairs for affine Weyl groups, A direct algorithm for restricted rotation distance, The phagocyte lattice of Dyck words, Compatibility fans for graphical nested complexes, Higher secondary polytopes and regular plabic graphs, Unnamed Item, Flip-graph moduli spaces of filling surfaces, Catalan triangulations of the Möbius band, Distances in Domino Flip Graphs, Computing the flip distance between triangulations, Modular flip-graphs of one-holed surfaces, Lower bounds on the rotation distance of binary trees, A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment, Refined upper bounds for right-arm rotation distances, Edge contraction on dual ribbon graphs and 2D TQFT, COLORING CURVES ON SURFACES, A proof of the orbit conjecture for flipping edge-labelled triangulations, Flip distance between triangulations of a simple polygon is NP-complete, A type-B associahedron., A metric for rooted trees with unlabeled vertices based on nested parentheses, Iterated fiber polytopes, Topological recursion for symplectic volumes of moduli spaces of curves, Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees, Arc diagrams, flip distances, and Hamiltonian triangulations, The dual diameter of triangulations, Flipping edge-labelled triangulations, Symmetries of unlabelled planar triangulations, Flip distance between two triangulations of a point set is NP-complete, The genus of curve, pants and flip graphs, Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra, Unnamed Item, Topological recursion for the Poincaré polynomial of the combinatorial moduli space of curves, Blockers for triangulations of a convex polygon and a geometric maker-breaker game, NONCROSSING SETS AND A GRASSMANN ASSOCIAHEDRON, Multitriangulations, pseudotriangulations and primitive sorting networks, Flip distance between triangulations of a planar point set is APX-hard, Random recursive triangulations of the disk via fragmentation theory, A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes, On a subposet of the Tamari lattice, The diameter of associahedra, The higher Stasheff‐Tamari posets, A generalization of diagonal flips in a convex polygon, Edge Conflicts do not Determine Geodesics in the Associahedron, The diameter of type \(D\) associahedra and the non-leaving-face property, Flipping in spirals, Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron, Flips in planar graphs, On the deque conjecture for the splay algorithm, How I ‘met’ Dov Tamari, Discriminative measures for comparison of phylogenetic trees, \(W\)-associahedra have the non-leaving-face property, Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex, The cost of offline binary search tree algorithms and the complexity of the request sequence, Computing spin networks, Triangle-free triangulations, Rotation sequences and edge-colouring of binary tree pairs, The rotation graph of \(k\)-ary trees is Hamiltonian, Cut loci in lens manifolds, The Fermat star of binary trees, Rotation distance is fixed-parameter tractable, Associahedra via spines, Generating All Triangulations of Plane Graphs (Extended Abstract), Once punctured disks, non-convex polygons, and pointihedra, Transforming plane triangulations by simultaneous diagonal flips, A point set whose space of triangulations is disconnected, The permutoassociahedron, Mac Lane's coherence theorem and asymptotic zones for the KZ equation, A Glimpse into Thurston’s Work, Multitriangulations as complexes of star polygons, On minimal triangulations of products of convex polygons, Constructions and complexity of secondary polytopes, Minimum ideal triangulations of hyperbolic 3-manifolds, Signed diagonal flips and the four color theorem, Enumeration of rooted planar triangulations with respect to diagonal flips, Bounding restricted rotation distance, An improved kernel size for rotation distance in binary trees, Non-leaving-face property for marked surfaces, Unnamed Item, Graphs of triangulations and perfect matchings, Diameter estimates for graph associahedra, Spin network quantum simulator, Restricted rotation distance between binary trees., A Motzkin filter in the Tamari lattice, An algorithm to compute the möbius function of the rotation lattice of binary trees, Geometry of the space of phylogenetic trees, Motzkin subposets and Motzkin geodesics in Tamari lattices., Neighborhoods of trees in circular orderings, An efficient upper bound of the rotation distance of binary trees, Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution, Restricted rotation distance between k-ary trees, Curves on the torus intersecting at most k times, Ranking trees generated by rotations, Posets and Spaces of $k$-Noncrossing RNA Structures, Lagrangian fillings in \(A\)-type and their Kálmán loop orbits, Exchange graphs of cluster algebras have the non‐leaving‐face property, Sampling planar tanglegrams and pairs of disjoint triangulations, Celebrating Loday's associahedron, A survey of parameterized algorithms and the complexity of edge modification, An improved kernel for the flip distance problem on simple convex polygons, Rotation distance for rank bounded trees, Normalish Amenable Subgroups of the R. Thompson Groups, Combinatorial Generation via Permutation Languages. V. Acyclic Orientations, A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points, The rotation distance of brooms, Unnamed Item, A journey from the Hitchin section to the oper moduli, Rainbow Cycles in Flip Graphs, On flips in planar matchings, Unnamed Item, Transition operations over plane trees, Flip distances between graph orientations, The geometry of flip graphs and mapping class groups, Unnamed Item, Rainbow Cycles in Flip Graphs.
Cites Work
