638 search results - page 5 / 128 » Track Layouts of Graphs |
86
Voted
GD
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
ECEASST
2008
14 years 9 months ago
2008
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
GD
2007
Springer
15 years 3 months ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
GD
2009
Springer
15 years 26 days ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...