Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

JGAA
2002

favoriteEmaildiscussreport

81views more JGAA 2002»

Graph Drawing in Motion

13 years 4 months ago

Graph Drawing in Motion

Download www.cs.brown.edu

Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly transform one drawing of a graph into another without any restrictions to the class of graphs or type of layout algorithm. Communicated by M. Kaufmann: submitted February 2001; revised February 2002. Research supported in part by DSTO Australia.

Carsten Friedrich, Peter Eades

Real-time Traffic

Graph Drawing | JGAA 2002 | Major Problem | Mental Map |

claim paper

Related Content

» Minimizing the Area for Planar StraightLine Grid Drawings

» A Note on the Selfsimilarity of Some Orthogonal Drawings

» Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size

» Straightline grid drawings of planar graphs with linear area

» Convex drawings of graphs with nonconvex boundary constraints

» Convex Grid Drawings of Plane Graphs with Rectangular Contours

» Morphing Planar Graphs in Spherical Space

» HexGraph Applying Graph Drawing Algorithms to the Game of Hex

» Large QuasiTree Drawing A Neighborhood Based Approach

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JGAA
Authors	Carsten Friedrich, Peter Eades

Comments (0)