Flipping edges in triangulations
From MaRDI portal
Publication:1807608
DOI10.1007/PL00009464zbMath0939.68135OpenAlexW2029387472WikidataQ56047091 ScholiaQ56047091MaRDI QIDQ1807608
Jorge Urrutia, Marc Noy, Ferran Hurtado
Publication date: 23 November 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009464
Related Items
Adaptive, anisotropic and hierarchical cones of discrete convex functions, Hamiltonian triangular refinements and space-filling curves, Counting carambolas, Number of Crossing-Free Geometric Graphs vs. Triangulations, SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS, Transforming pseudo-triangulations, An efficient algorithm for estimating rotation distance between two binary trees, The edge rotation graph, Computing the flip distance between triangulations, Flipping triangles and rectangles, A proof of the orbit conjecture for flipping edge-labelled triangulations, Combinatorics. Abstracts from the workshop held January 1--7, 2023, A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems, Flip distance between triangulations of a simple polygon is NP-complete, Flip paths between lattice triangulations, On the longest flip sequence to untangle segments in the plane, Complexity results on untangling red-blue matchings, The Mathematics of Ferran Hurtado: A Brief Survey, Convex blocking and partial orders on the plane, Flipping edge-labelled triangulations, Flip distance between two triangulations of a point set is NP-complete, Flip distance between triangulations of a planar point set is APX-hard, Unnamed Item, A generalized Winternitz theorem, Counting polygon triangulations is hard, Simultaneously Flippable Edges in Triangulations, On local transformations in plane geometric graphs embedded on small grids, Fast enumeration algorithms for non-crossing geometric graphs, Gray code enumeration of plane straight-line graphs, Flipping in spirals, Flips in planar graphs, Flips in edge-labelled pseudo-triangulations, Pre-triangulations and liftable complexes, Counting triangulations of some classes of subdivided convex polygons, Triangulations without pointed spanning trees, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, Non-connected toric Hilbert schemes, Disjoint compatibility graph of non-crossing matchings of points in convex position, Enumerating pseudo-triangulations in the plane, Minimum weight connectivity augmentation for planar straight-line graphs, Unnamed Item, Once punctured disks, non-convex polygons, and pointihedra, Geometric quadrangulations of a polygon, On almost empty monochromatic triangles and convex quadrilaterals in colored point sets, Minimal surfaces from infinitesimal deformations of circle packings, Rainbow Cycles in Flip Graphs, Unnamed Item, An improved FPT algorithm for the flip distance problem, Quadrangulations of a polygon with spirality, Triangulations intersect nicely, The Perfect Matching Reconfiguration Problem, Transforming spanning trees and pseudo-triangulations, FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR, Rainbow Cycles in Flip Graphs., Flip distance to some plane configurations, Flip Graphs of Bounded-Degree Triangulations, Flip Distance to some Plane Configurations., Graphs of triangulations and perfect matchings, On local transformation of polygons with visibility properties., Connectivity of triangulation flip graphs in the plane, On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points, An efficient algorithm for enumeration of triangulations, An efficient upper bound of the rotation distance of binary trees, Edge flips in surface meshes, Bichromatic compatible matchings
