The rotation graph of binary trees is hamiltonian
Journal of Algorithms
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
The neutral case for the min-max triangulation
Computer Aided Geometric Design
Minimal roughness property of the Delaunay triangulation
Computer Aided Geometric Design
Minimum energy tiangulations for elliptic problems
Computer Methods in Applied Mechanics and Engineering
An O(n2logn) time algorithm for the minmax angle triangulation
SIAM Journal on Scientific and Statistical Computing
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Short encodings of evolving structures
SIAM Journal on Discrete Mathematics
A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Diagonal flips in triangulations of surfaces
Discrete Mathematics
Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Distances between graphs under edge operations
Discrete Mathematics
A Survey of Combinatorial Gray Codes
SIAM Review
Geometric tree graphs of points in convex position
Discrete Applied Mathematics - Special issue on the 13th European workshop on computational geometry CG '97
Analytic combinatorics of non-crossing configurations
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
Graph of triangulations of a convex polygon and tree of triangulations
Computational Geometry: Theory and Applications
Mental imagery in program design and visual programming
International Journal of Human-Computer Studies - Best of empirical studies of programmers 7
Signed diagonal flips and the four color theorem
European Journal of Combinatorics - In memoriam François Jaeger
Diagonal flips in outer-torus triangulations
Discrete Mathematics
Diagonal flips in outer-Klein-bottle triangulations
Discrete Mathematics
Hamilton cycles in the path graph of a set of points in convex position
Computational Geometry: Theory and Applications
Optimizing 3D triangulations using discrete curvature analysis
Mathematical Methods for Curves and Surfaces
Sequences of spanning trees and a fixed tree theorem
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
Higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Flips signés et triangulations d'un polygone
European Journal of Combinatorics
On local transformation of polygons with visibility properties
Theoretical Computer Science
Polyhedral Metrics in Surface Reconstruction
Proceedings of the 6th IMA Conference on the Mathematics of Surfaces
An efficient algorithm for enumeration of triangulations
Computational Geometry: Theory and Applications
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
SIAM Journal on Computing
Transforming pseudo-triangulations
Information Processing Letters
Graphs of Triangulations and Perfect Matchings
Graphs and Combinatorics
Random triangulations of planar point sets
Proceedings of the twenty-second annual symposium on Computational geometry
On the Number of Crossing-Free Matchings, Cycles, and Partitions
SIAM Journal on Computing
A quadratic distance bound on sliding between crossing-free spanning trees
Computational Geometry: Theory and Applications
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On the Number of Plane Geometric Graphs
Graphs and Combinatorics
Enumerating Non-crossing Minimally Rigid Frameworks
Graphs and Combinatorics
On local transformations in plane geometric graphs embedded on small grids
Computational Geometry: Theory and Applications
Simultaneous diagonal flips in plane triangulations
Journal of Graph Theory
Reconfiguring triangulations with edge flips and point moves
GD'04 Proceedings of the 12th international conference on Graph Drawing
Planar tree transformation: Results and counterexample
Information Processing Letters
On the diameter of geometric path graphs of points in convex position
Information Processing Letters
An application of a self-organizing model to the design of urban transport networks
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Evolutionary neural networks for practical applications
Amortized efficiency of generating planar paths in convex position
Theoretical Computer Science
Counting plane graphs: flippability and its applications
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Making triangulations 4-connected using flips
Computational Geometry: Theory and Applications
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
Flipping triangles and rectangles
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We review results concerning edge flips in planar graphs concentrating mainly on various aspects of the following problem: Given two different planar graphs of the same size, how many edge flips are necessary and sufficient to transform one graph into another? We overview both the combinatorial perspective (where only a combinatorial embedding of the graph is specified) and the geometric perspective (where the graph is embedded in the plane, vertices are points and edges are straight-line segments). We highlight the similarities and differences of the two settings, describe many extensions and generalizations, highlight algorithmic issues, outline several applications and mention open problems.