Proximity Drawings of High-Degree Trees

Details Proximity Drawings of High-Degree Trees Proximity Drawings of High-Degree Trees

2010-08-19

arxiv.org/abs/1008.3193v1

Computer Science

Computational Geometry

Scientific paper

A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree? We approach this question by supposing that a partition or covering of the tree by subtrees of bounded degree is given. Then we show that if the partition or covering satisfies some natural properties, then there is a drawing of the entire tree such that each of the given subtrees is drawn as a minimum spanning tree of its vertex set.

Affiliated with

Also associated with

No associations

Rating

Proximity Drawings of High-Degree Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proximity Drawings of High-Degree Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proximity Drawings of High-Degree Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-134448