Flips in planar graphs
From MaRDI portal
Publication:950400
DOI10.1016/J.COMGEO.2008.04.001zbMATH Open1146.05016OpenAlexW2089645963MaRDI QIDQ950400FDOQ950400
Ferran Hurtado, Prosenjit Bose
Publication date: 22 October 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.04.001
Recommendations
algorithmscomputational geometryplanar graphstheorygeometrical embeddinglocal transformationsalgorithmic issuescombinatorial embeddingedge flips
Cites Work
- Short Encodings of Evolving Structures
- Title not available (Why is that?)
- Research Problems in Discrete Geometry
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Flipping edges in triangulations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On connectivities of tree graphs
- On the Tree Graph of a Matroid
- Geometric tree graphs of points in convex position
- Analytic combinatorics of non-crossing configurations
- Distances between graphs under edge operations
- Reverse search for enumeration
- On the number of plane geometric graphs
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- Crossing-Free Subgraphs
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Generating rooted triangulations without repetitions
- Transforming triangulations
- A Theorem on Planar Graphs
- The rotation graph of binary trees is Hamiltonian
- A Survey of Combinatorial Gray Codes
- Title not available (Why is that?)
- The associahedron and triangulations of the \(n\)-gon
- Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone
- Title not available (Why is that?)
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Title not available (Why is that?)
- A quadratic distance bound on sliding between crossing-free spanning trees
- Diagonal flips in Hamiltonian triangulations on the sphere
- Bemerkungen zum Vierfarbenproblem
- Title not available (Why is that?)
- Simultaneous diagonal flips in plane triangulations
- Generalized Delaunay triangulation for planar graphs
- Constrained Delaunay triangulations
- Higher order Delaunay triangulations
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- Optimizing 3D triangulations using discrete curvature analysis
- Data Dependent Triangulations for Piecewise Linear Interpolation
- Minimal roughness property of the Delaunay triangulation
- Transforming pseudo-triangulations
- Title not available (Why is that?)
- Graph of triangulations of a convex polygon and tree of triangulations
- Graphs of triangulations and perfect matchings
- Diagonal flips in triangulations of surfaces
- Multivariate approximation and applications
- Title not available (Why is that?)
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Signed diagonal flips and the four color theorem
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
- Title not available (Why is that?)
- Enumerating non-crossing minimally rigid frameworks
- Gray code enumeration of plane straight-line graphs
- Hamilton cycles in the path graph of a set of points in convex position
- Sequences of spanning trees and a fixed tree theorem
- Happy endings for flip graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mesh relaxation: A new technique for improving triangulations
- Edge insertion for optimal triangulations
- Title not available (Why is that?)
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Graph Drawing
- Wagner's theorem for torus graphs
- Diagonal transformations of triangulation on surfaces
- The neutral case for the min-max triangulation
- Minimum energy triangulations for elliptic problems
- Diagonal flips in outer-torus triangulations
- Diagonal flips in outer-Klein-bottle triangulations
- Diagonal flips in outer-triangulations on closed surfaces
- On local transformation of polygons with visibility properties.
- An efficient algorithm for enumeration of triangulations
- On local transformations in plane geometric graphs embedded on small grids
- ON FLIPS IN POLYHEDRAL SURFACES
- Title not available (Why is that?)
- Compatible Geometric Matchings
- Diagonal flips in labelled planar triangulations
Cited In (58)
- Quasipolynomiality of the Smallest Missing Induced Subgraph
- Switches in Eulerian graphs
- Flipping plane spanning paths
- Complexity results on untangling red-blue matchings
- How close is a quad mesh to a polycube?
- Flip distance and triangulations of a polyhedron
- Flipping in spirals
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- On planar path transformation
- Flip distance between two triangulations of a point set is NP-complete
- Elimination properties for minimal dominating sets of graphs
- Transition operations over plane trees
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Kernelization of Whitney Switches
- Flipping edge-labelled triangulations
- On the rotation distance between binary trees
- Flip Distance to some Plane Configurations.
- Rainbow Cycles in Flip Graphs.
- Flip graphs of stacked and flag triangulations of the 2-sphere
- A model to simplify 2D triangle meshes with irregular shapes
- Rainbow Cycles in Flip Graphs
- Optimal Area Polygonization by Triangulation and Visibility Search
- Complexity of token swapping and its variants
- Kernelization of Whitney Switches
- Algorithm Theory - SWAT 2004
- Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex
- Happy endings for flip graphs
- FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR
- Flip graphs of bounded degree triangulations
- A survey of parameterized algorithms and the complexity of edge modification
- Flip graphs of bounded-degree triangulations
- Simultaneously Flippable Edges in Triangulations
- Flip graphs, Yoke graphs and diameter
- Packing disks by flipping and flowing
- Flip distance between triangulations of a simple polygon is NP-complete
- Quadrangulations of a polygon with spirality
- Compatible spanning trees in simple drawings of \(K_n\)
- Geometric quadrangulations of a polygon
- Amortized efficiency of generating planar paths in convex position
- Transforming plane triangulations by simultaneous diagonal flips
- On the diameter of geometric path graphs of points in convex position
- Planar tree transformation: results and counterexample
- The edge rotation graph
- Connecting polygonizations via stretches and twangs
- Flip graphs for infinite type surfaces
- Reducing Urban Concentration Using a Neural Network Model
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Flip distance to some plane configurations
- The Mathematics of Ferran Hurtado: A Brief Survey
- Convex dominating sets in maximal outerplanar graphs
- A History of Flips in Combinatorial Triangulations
- Flip distance between triangulations of a planar point set is APX-hard
- A lower bound on the diameter of the flip graph
- Flip distances between graph orientations
- Flipping triangles and rectangles
- Computing the flip distance between triangulations
- Reconfiguration on sparse graphs
- Making triangulations 4-connected using flips
This page was built for publication: Flips in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950400)
