Short flip sequences to untangle segments in the plane
From MaRDI portal
Publication:6575392
DOI10.1007/978-981-97-0566-5_13MaRDI QIDQ6575392
Bastien Rivier, G. D. da Fonseca, Yan Gerard
Publication date: 19 July 2024
Cites Work
- Flip distance between triangulations of a simple polygon is NP-complete
- Flip distance between two triangulations of a point set is NP-complete
- On the diameter of geometric path graphs of points in convex position
- Flipping edges in triangulations
- Flip distance to some plane configurations
- Introduction to reconfiguration
- On planar path transformation
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- Flip distance between triangulations of a planar point set is APX-hard
- Transforming triangulations
- The complexity of change
- Approximating Shortest Connected Graph Transformation for Trees
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Switching Distance Between Graphs with the Same Degrees
- On the Swap-Distances of Different Realizations of a Graphical Degree Sequence
- The Perfect Matching Reconfiguration Problem
- Transforming Graphs with the Same Degree Sequence
- The Number of Flips Required to Obtain Non-crossing Convex Cycles
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- Complexity results on untangling red-blue matchings
This page was built for publication: Short flip sequences to untangle segments in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575392)
