Short Flip Sequences to Untangle Segments in the Plane ⋆ - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Short Flip Sequences to Untangle Segments in the Plane ⋆

Résumé

A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip operation. We remove a pair of crossing segments, and insert a pair of non-crossing segments, while keeping the same vertex degrees. The goal of this paper is to devise efficient strategies to flip the segments in order to obtain crossing-free segments after a small number of flips. Linear and near-linear bounds on the number of flips were only known for segments with endpoints in convex position. We generalize these results, proving linear and near-linear bounds for cases with endpoints that are not in convex position. Our results are proved in a general setting that applies to multiple problems, using multigraphs and the distinction between removal and insertion choices when performing a flip.
Fichier principal
Vignette du fichier
Short_Flip_Sequences.pdf (710.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04505473 , version 1 (14-03-2024)

Licence

Paternité

Identifiants

Citer

Guilherme da Fonseca, Yan Gerard, Bastien Rivier. Short Flip Sequences to Untangle Segments in the Plane ⋆. WALCOM 2024, Mar 2024, Kanazawa, Ishikawa, Japan. pp.163-178, ⟨10.1007/978-981-97-0566-5_13⟩. ⟨hal-04505473⟩
1 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More