Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Proximity drawings of high-degree trees

Autor
Hurtado, F.; Liotta, G.; Wood, D.
Tipus d'activitat
Article en revista
Revista
International journal of computational geometry and applications
Data de publicació
2013-06
Volum
23
Número
3
Pàgina inicial
213
Pàgina final
230
DOI
https://doi.org/10.1142/S0218195913500088 Obrir en finestra nova
Resum
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...
Paraules clau
Graph Drawing, Tree, Proximity Graph, Minimum Spanning Tree, Relative Neigh-bourhood Graph
Grup de recerca
DCG - Discrete and Combinatorial Geometry

Participants

  • Hurtado Diaz, Fernando Alfredo  (autor)
  • Liotta, Giuseppe  (autor)
  • Wood, David R.  (autor)