Chapter

Computer Vision and Graphics

Volume 32 of the series Computational Imaging and Vision pp 633-641

BUBBLE TREE DRAWING ALGORITHM

  • S. GrivetAffiliated withLaBRI-Université Bordeaux 1, 351 Cours de la Libération
  • , D. AuberAffiliated withLaBRI-Université Bordeaux 1, 351 Cours de la Libération
  • , J. P. DomengerAffiliated withLaBRI-Université Bordeaux 1, 351 Cours de la Libération
  • , G. MelanconAffiliated withLIRMM Montepellier

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In this paper, we present an algorithm, called Bubble Tree, for the drawing of general rooted trees. A large variety of algorithms already exists in this field. However, the goal of this algorithm is to obtain a better drawing which makes a trade off between the angular resolution and the length of the edges. We show that the Bubble Tree drawing algorithm provides a planar drawing with at most one bend per edge in linear running time.