%0 Generic
%A Poon, Sheung-Hung
%D 2006
%E Healy, Patrick
%E Nikolov, Nikola S.
%F gdea_3:731
%P 519-521
%T On Straightening Low-Diameter Unit Trees
%U http://gdea.informatik.uni-koeln.de/731/
%X 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. ...