Cover Image

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aichholzer, Oswin, Dorfer, Joseph
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Constrained Flips in Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2025)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
by: Aichholzer, Oswin, et al.
Published: (2026)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
by: Aichholzer, Oswin, et al.
Published: (2026)

Flipping odd matchings in geometric and combinatorial settings
by: Aichholzer, Oswin, et al.
Published: (2025)

Flips in Odd Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
by: Dorfer, Joseph
Published: (2026)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
by: Bjerkevik, Håvard Bakke, et al.
Published: (2026)

Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

Folding polyominoes into cubes
by: Aichholzer, Oswin, et al.
Published: (2024)

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
by: Aichholzer, Oswin, et al.
Published: (2023)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
by: Aichholzer, Oswin, et al.
Published: (2024)

Minimum Plane Bichromatic Spanning Trees
by: Akitaya, Hugo A., et al.
Published: (2024)

Drawings of Complete Multipartite Graphs Up to Triangle Flips
by: Aichholzer, Oswin, et al.
Published: (2023)

Characterizing and Recognizing Twistedness
by: Aichholzer, Oswin, et al.
Published: (2025)

Connected Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Disjoint Compatibility via Graph Classes
by: Aichholzer, Oswin, et al.
Published: (2024)

Further Connectivity Results on Plane Spanning Path Reconfiguration
by: Boucard, Valentino, et al.
Published: (2024)

Garment numbers of bi-colored point sets in the plane
by: Aichholzer, Oswin, et al.
Published: (2026)

An Overview of Minimum Convex Cover and Maximum Hidden Set
by: Browne, Reilly
Published: (2024)

Minimum Monotone Spanning Trees
by: Di Giacomo, Emilio, et al.
Published: (2024)

Geometric Give and Take
by: Aichholzer, Oswin, et al.
Published: (2026)

Minimum-Weight Half-Plane Hitting Set
by: Liu, Gang, et al.
Published: (2025)

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
by: Draganov, Ondřej, et al.
Published: (2025)

Flipping Non-Crossing Spanning Trees
by: Bjerkevik, Håvard Bakke, et al.
Published: (2024)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
by: Chan, Timothy M., et al.
Published: (2025)

On the Largest Convexity Number of Co-Finite Sets in the Plane
by: Keller, Chaya, et al.
Published: (2026)

Finding Closed Quasigeodesics on Convex Polyhedra
by: Demaine, Erik D., et al.
Published: (2020)

Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
by: Lynch, Jayson, et al.
Published: (2025)

Edge-Constrained Hamiltonian Paths on a Point Set
by: Antić, Todor, et al.
Published: (2025)

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
by: Yang, Chao, et al.
Published: (2025)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

Flip Paths Between Lattice Triangulations
by: Sims, William, et al.
Published: (2020)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
by: Tkachenko, Anastasiia, et al.
Published: (2024)

Minimum Membership Geometric Set Cover in the Continuous Setting
by: Govindarajan, Sathish, et al.
Published: (2025)

Convex Polygon Containment: Improving Quadratic to Near Linear Time
by: Chan, Timothy M., et al.
Published: (2024)

An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)

Equichordal Points of Convex Bodies
by: Jang, Leo, et al.
Published: (2025)

Convex Covering Using Collections of Convex Polygons and Set Cover
by: da Fonseca, Guilherme D.
Published: (2023)

Simple but not Simpler: A Surface-Sliding Method for Finding the Minimum Distance between Two Ellipsoids
by: Amirkhani, Dariush, et al.
Published: (2026)