We study the reconfiguration of plane spanning trees on point sets in the plane in convex position, where a reconfiguration step (flip) replaces one edge with another, yielding again a plane spanning tree. The flip distance between two trees is then the minimum number of flips needed to transform one tree into the other. We study structural properties of shortest flip sequences.
The folklore happy edge conjecture suggests that any edge shared by both the initial and target tree is never flipped in a shortest flip sequence. The more recent parking edge conjecture, which would have implied the happy edge conjecture, states that there exist shortest flip sequences which use only edges of the start and target tree, and edges in the convex hull of the point set. Finally, another conjecture that is implicit in the literature is the reparking conjecture which states that no edge is flipped more than twice. Essentially all recent flip algorithms respect these three conjectures and the properties they imply. We study cases in which the latter two conjectures hold and disprove them for the general setting.
(Shortened abstract due to arXiv restrictions.)
Khoury College of Computer Sciences, Northeastern University(东北大学科里计算机科学学院);School of Computer Science, University of Windsor(温莎大学计算机学院);School of Computer Science, Carleton University(卡尔顿大学计算机学院);School of Electrical Engineering and Computer Science, University of Ottawa(渥太华大学电气与计算机工程学院);Computer Science Department, University of California, Irvine(加州大学欧文分校计算机科学系);Department of Mathematics, California State University Northridge(北岭加利福尼亚州立大学数学系);Department of Computer Science, Tufts University(塔夫茨大学计算机科学系);Department of Applied Mathematics, Charles University(查理大学应用数学系)
University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校);Tel Aviv University(特拉维夫大学);California State University Northridge(北岭加州州立大学);Tufts University(塔夫茨大学);Nanjing University(南京大学)