On Straightening Low-Diameter Unit Trees

Poon, Sheung-Hung (2006) On Straightening Low-Diameter Unit Trees. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 519-521(Official URL: http://dx.doi.org/10.1007/11618058_51).

Full text not available from this repository.


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. ...

Item Type: Conference Poster
Additional Information: 10.1007/11618058_51
Classifications: M Methods > M.900 Tree
URI: http://gdea.informatik.uni-koeln.de/id/eprint/731

Actions (login required)

View Item View Item