10 search results - page 2 / 2 » On Balloon Drawings of Rooted Trees |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
VISSOFT
2005
IEEE
13 years 11 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
JDA
2006
13 years 5 months ago
2006
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
TOG
2008
13 years 5 months ago
2008
In this paper, we introduce a simple sketching method to generate a realistic 3D tree model from a single image. The user draws at least two strokes in the tree image: the first c...
ESA
2008
Springer
13 years 7 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...