Short flip sequences to untangle segments in the plane

DOI10.1007/978-981-97-0566-5_13MaRDI QIDQ6575392zbMATH OpenFDO

Authors Guilherme D. Da Fonseca, Yan Gerard, Bastien Rivier

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1007/978-981-97-0566-5_13

zbMATH Keywords

Euclidean TSPmatchingplanar geometryreconfiguration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Approximating shortest connected graph transformation for trees
• Flip distance between triangulations of a planar point set is APX-hard
• Flip distance between two triangulations of a point set is NP-complete
• Flip distance to some plane configurations
• Flipping edges in triangulations
• Introduction to reconfiguration
• On planar path transformation
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the diameter of geometric path graphs of points in convex position
• On the swap-distances of different realizations of a graphical degree sequence
• Switching Distance Between Graphs with the Same Degrees
• The complexity of change
• The Number of Flips Required to Obtain Non-crossing Convex Cycles
• The Perfect Matching Reconfiguration Problem
• Transforming Graphs with the Same Degree Sequence
• Transforming triangulations
• Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP

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)