725 search results - page 46 / 145 » Graph Drawing in Motion |
GD
2006
Springer
14 years 1 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
ESA
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
TOG
2002
13 years 9 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
GRAPHITE
2005
ACM
14 years 3 months ago
2005
ACM
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...
GD
2009
Springer
14 years 2 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...