5889 search results - page 13 / 1178 » Graph Layout Problems |
GD
2004
Springer
14 years 3 months ago
2004
Springer
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
GD
1995
Springer
14 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
14 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...
WEA
2007
Springer
14 years 3 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
ECEASST
2008
13 years 10 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...