Bubble Tree Drawing Algorithm

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.
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00108872
Contributor : Christine Carvalho de Matos <>
Submitted on : Wednesday, February 6, 2019 - 8:10:04 PM
Last modification on : Thursday, February 7, 2019 - 5:57:43 PM
Long-term archiving on : Tuesday, May 7, 2019 - 3:35:50 PM

File

Bubble_Tree_Drawing_Algorithm....
Files produced by the author(s)

Identifiers

Citation

Sébastien Grivet, David Auber, Jean-Philippe Domenger, Guy Melançon. Bubble Tree Drawing Algorithm. ICCVG: International Conference on Computer Vision Graphics, Sep 2004, Warsaw, Poland. pp.633-641, ⟨10.1007/1-4020-4179-9_91⟩. ⟨lirmm-00108872⟩

Share

Metrics

Record views

153

Files downloads

56