156 search results - page 2 / 32 » Matched Drawings of Planar Graphs |
JDA
2010
13 years 4 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
GD
2009
Springer
13 years 10 months ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...
GD
2006
Springer
13 years 9 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
ALGORITHMICA
2006
13 years 5 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
GD
2007
Springer
13 years 12 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...