1265 search results - page 22 / 253 » Algorithms for Drawing Media |
GD
1999
Springer
14 years 22 days ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
INFOVIS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
GD
2003
Springer
14 years 1 months ago
2003
Springer
We consider the problem of drawing Venn diagrams for which each region’s area is proportional to some weight (e.g., population or percentage) assigned to that region. These area-...
GD
2008
Springer
13 years 9 months ago
2008
Springer
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so...
GIAE
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we propose the wireframe representation of nD object, which is a single 2D line drawing. A wireframe model of an nD object is composed of a set of edges connecting a...