A general rooted tree drawing algorithm is designed in this paper. It satisfies the basic aesthetic criteria and can be well applied to binary trees. Given an area, any complex tree can be drawn within the area in users\u27 favorite styles. The algorithm is efficient with O(LxNxlogN) time complexity and self-adaptive as well.<br /
Research on the aesthetic layout of trees has been largely concerned with the special case of binary...
We study the width requirements of LR-drawings of n-node ordered rooted binary trees; these are the ...
The tree-drawing problem is to produce a 'tidy' mapping from elements of a tree to points in the pla...
International audienceIn this paper, we present an algorithm, called Bubble Tree, for the drawing of...
This article describes the application of functional programming techniques to a problem previously ...
Tree Drawings have been used extensively in software engineering and many other business and compute...
The tree-drawing problem\\/ is to produce a `tidy' mapping of elements of a tree to points in the p...
The tree-drawing problem\\/ is to produce a `tidy' mapping of elements of a tree to points in the p...
This article describes the application of functional programming techniques to a problem previously ...
In this paper, we proposed a new approach for drawing rooted trees on circles. Previous approaches e...
An upward drawing of a rooted tree T is a planar straight-line drawing of T where the vertices of T ...
[[abstract]]In a balloon drawing of a tree, all the children under the same parent are placed on the...
We study a family of algorithms, introduced by Chan [SODA 1999], for drawing ordered rooted binary t...
We describe an algorithm producing circular layouts for trees, that is drawings, where subtrees of a...
Rooted trees are usually drawn planar and upward, i.e., without crossings and with parents placed ab...
Research on the aesthetic layout of trees has been largely concerned with the special case of binary...
We study the width requirements of LR-drawings of n-node ordered rooted binary trees; these are the ...
The tree-drawing problem is to produce a 'tidy' mapping from elements of a tree to points in the pla...
International audienceIn this paper, we present an algorithm, called Bubble Tree, for the drawing of...
This article describes the application of functional programming techniques to a problem previously ...
Tree Drawings have been used extensively in software engineering and many other business and compute...
The tree-drawing problem\\/ is to produce a `tidy' mapping of elements of a tree to points in the p...
The tree-drawing problem\\/ is to produce a `tidy' mapping of elements of a tree to points in the p...
This article describes the application of functional programming techniques to a problem previously ...
In this paper, we proposed a new approach for drawing rooted trees on circles. Previous approaches e...
An upward drawing of a rooted tree T is a planar straight-line drawing of T where the vertices of T ...
[[abstract]]In a balloon drawing of a tree, all the children under the same parent are placed on the...
We study a family of algorithms, introduced by Chan [SODA 1999], for drawing ordered rooted binary t...
We describe an algorithm producing circular layouts for trees, that is drawings, where subtrees of a...
Rooted trees are usually drawn planar and upward, i.e., without crossings and with parents placed ab...
Research on the aesthetic layout of trees has been largely concerned with the special case of binary...
We study the width requirements of LR-drawings of n-node ordered rooted binary trees; these are the ...
The tree-drawing problem is to produce a 'tidy' mapping from elements of a tree to points in the pla...
DOI
Add to ORKG