title: On Straightening Low-Diameter Unit Trees
creator: Poon, Sheung-Hung
subject: Z.999 Others
description: 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. ...
contributor: Healy, Patrick
contributor: Nikolov, Nikola S.
date: 2006
type: Conference Poster
type: NonPeerReviewed
identifier: Poon, Sheung-Hung (2006) On Straightening Low-Diameter Unit Trees. [Conference Poster]
relation: http://gdea.informatik.uni-koeln.de/731/