Sciweavers

13 search results - page 3 / 3
» Three-dimensional 1-bend graph drawings
Sort
View
COMGEO
2004
ACM
13 years 5 months ago
A multi-dimensional approach to force-directed layouts of large graphs
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
GD
2009
Springer
13 years 9 months ago
Manhattan-Geodesic Embedding of Planar Graphs
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...
Bastian Katz, Marcus Krug, Ignaz Rutter, Alexander...
GRAPHITE
2005
ACM
13 years 10 months ago
Uniting cartoon textures with computer assisted animation
We present a novel method to create perpetual animations from a small set of given keyframes. Existing approaches either are limited to re-sequencing large amounts of existing ima...
William Van Haevre, Fabian Di Fiore, Frank Van Ree...