Flips in planar graphs
From MaRDI portal
Publication:950400
Recommendations
Cites work
- scientific article; zbMATH DE number 1590945 (Why is no real title available?)
- scientific article; zbMATH DE number 5506218 (Why is no real title available?)
- scientific article; zbMATH DE number 19420 (Why is no real title available?)
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- scientific article; zbMATH DE number 1241392 (Why is no real title available?)
- scientific article; zbMATH DE number 1342089 (Why is no real title available?)
- scientific article; zbMATH DE number 1008326 (Why is no real title available?)
- scientific article; zbMATH DE number 1017008 (Why is no real title available?)
- scientific article; zbMATH DE number 1053457 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- scientific article; zbMATH DE number 1418487 (Why is no real title available?)
- A Survey of Combinatorial Gray Codes
- A Theorem on Planar Graphs
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A quadratic distance bound on sliding between crossing-free spanning trees
- An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
- An efficient algorithm for enumeration of triangulations
- Analytic combinatorics of non-crossing configurations
- Bemerkungen zum Vierfarbenproblem
- Compatible Geometric Matchings
- Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone
- Connecting polygonizations via stretches and twangs
- Constrained Delaunay triangulations
- Crossing-Free Subgraphs
- Data Dependent Triangulations for Piecewise Linear Interpolation
- Diagonal flips in Hamiltonian triangulations on the sphere
- Diagonal flips in labelled planar triangulations
- Diagonal flips in outer-Klein-bottle triangulations
- Diagonal flips in outer-torus triangulations
- Diagonal flips in outer-triangulations on closed surfaces
- Diagonal flips in triangulations of surfaces
- Diagonal transformations of triangulation on surfaces
- Distances between graphs under edge operations
- Edge insertion for optimal triangulations
- Enumerating non-crossing minimally rigid frameworks
- Flipping edges in triangulations
- Flips signés et triangulations d'un polygone. (Signed flips and triangulations of a polygon)
- Generalized Delaunay triangulation for planar graphs
- Generating rooted triangulations without repetitions
- Geometric bistellar flips: the setting, the context and a construction
- Geometric tree graphs of points in convex position
- Graph Drawing
- Graph of triangulations of a convex polygon and tree of triangulations
- Graphs of triangulations and perfect matchings
- Gray code enumeration of plane straight-line graphs
- Gray codes for non-crossing partitions and dissections of a convex polygon
- Hamilton cycles in the path graph of a set of points in convex position
- Higher order Delaunay triangulations
- Mesh relaxation: A new technique for improving triangulations
- Minimal roughness property of the Delaunay triangulation
- Minimum energy triangulations for elliptic problems
- Multivariate approximation and applications
- ON FLIPS IN POLYHEDRAL SURFACES
- On connectivities of tree graphs
- On local transformation of polygons with visibility properties.
- On local transformations in plane geometric graphs embedded on small grids
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- On the Tree Graph of a Matroid
- On the number of plane geometric graphs
- Optimizing 3D triangulations using discrete curvature analysis
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Research Problems in Discrete Geometry
- Reverse search for enumeration
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Sequences of spanning trees and a fixed tree theorem
- Short Encodings of Evolving Structures
- Signed diagonal flips and the four color theorem
- The associahedron and triangulations of the \(n\)-gon
- The neutral case for the min-max triangulation
- The rotation graph of binary trees is Hamiltonian
- Transforming pseudo-triangulations
- Transforming triangulations
- Wagner's theorem for torus graphs
Cited in
(55)- Flipping plane spanning paths
- Flip distance and triangulations of a polyhedron
- Switches in Eulerian graphs
- How close is a quad mesh to a polycube?
- Transforming plane triangulations by simultaneous diagonal flips
- Flip graphs of bounded-degree triangulations
- Computing the flip distance between triangulations
- Flip-distance between \(\alpha \)-orientations of graphs embedded on the plane and sphere
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Packing disks by flipping and flowing
- A history of flips in combinatorial triangulations
- A model to simplify 2D triangle meshes with irregular shapes
- Flip distance to some plane configurations
- Quadrangulations of a polygon with spirality
- On planar path transformation
- Reducing urban concentration using a neural network model
- Compatible spanning trees in simple drawings of \(K_n\)
- On the diameter of geometric path graphs of points in convex position
- Planar tree transformation: results and counterexample
- Geometric quadrangulations of a polygon
- Flipping in spirals
- On the rotation distance between binary trees
- The edge rotation graph
- Elimination properties for minimal dominating sets of graphs
- Kernelization of Whitney Switches
- The Mathematics of Ferran Hurtado: A Brief Survey
- Convex dominating sets in maximal outerplanar graphs
- Flip distances between graph orientations
- Flipping triangles and rectangles
- Kernelization of Whitney switches
- Optimal Area Polygonization by Triangulation and Visibility Search
- Complexity of token swapping and its variants
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Flip graphs of bounded degree triangulations
- A survey of parameterized algorithms and the complexity of edge modification
- Flip distance between triangulations of a planar point set is APX-hard
- Flip distance between two triangulations of a point set is NP-complete
- Computational Science and Its Applications – ICCSA 2004
- Rainbow cycles in flip graphs
- Algorithm Theory - SWAT 2004
- Thompson's group \(\mathcal T\) is the orientation-preserving automorphism group of a cellular complex
- Connecting polygonizations via stretches and twangs
- Rainbow cycles in flip graphs
- A lower bound on the diameter of the flip graph
- Simultaneously flippable edges in triangulations
- Making triangulations 4-connected using flips
- Flips in combinatorial pointed pseudo-triangulations with face degree at most four
- Flipping edge-labelled triangulations
- Flip graphs for infinite type surfaces
- Amortized efficiency of generating planar paths in convex position
- Flip graphs, Yoke graphs and diameter
- Flip graphs of stacked and flag triangulations of the 2-sphere
- Flip distance to some plane configurations
- Quasipolynomiality of the Smallest Missing Induced Subgraph
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)
