@misc{gdea_3731,
          editor = {Patrick Healy and Nikola S. Nikolov},
           title = {On Straightening Low-Diameter Unit Trees},
          author = {Sheung-Hung Poon},
            year = {2006},
           pages = {519--521},
             url = {http://gdea.informatik.uni-koeln.de/731/},
        abstract = {A polygonal chain is a sequence of consecutively joined edges embedded in space. A k-chain is a chain of k edges. A polygonal tree is a set of edges joined into a tree structure embedded in space. A unit tree is a tree with only edges of unit lenght. A chain or a tree is simple if non-adjacent edges do not intersect. ...}
}