Abstract Parallel Morphing of Trees and Cycles ∗ (2008)
Therese Biedl, Anna Lubiw, Michael J. Spriggs
We prove that for any two simple chains [more generally, trees] in R d with corresponding edges parallel, there is a parallel morph between them—i.e. a morph in which all intermediate chains...
Minimum Spanning Trees on Polyhedra (2008)
In this paper, we consider the problem of generating a minimum spanning tree (MST) of a set of sites lying on the surface of an open polyhedron. The distance between any two sites is the length of a...
Computing a (1 + ffl)-Approximate Geometric Minimum-Diameter Spanning Tree (2003)
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Abstract Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST)of P is a spanning tree of P such that the longest path through the tree is minimized. Forseveral...
Approximating the Geometric Minimum Diameter Spanning Tree (2003)
Michael J. Spriggs, J. Mark, Keil Sergei, Bespamyatnikh Michael, Segal Jack Snoeyink
Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we...
Computing a (1+ɛ)-approximate geometric minimum-diameter spanning tree. Private communication (2002)
Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. For several years, the...
Minimum Spanning Trees on Polyhedra (1999)
Michael J. Spriggs, J. Mark Keil
In this paper, we consider the problem of generating a minimum spanning tree (MST) of a set of sites lying on the surface of an open polyhedron. The distance between any two sites is the length of a...