GD
2000
Springer
13 years 11 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
GD
2000
Springer
13 years 11 months ago
2000
Springer
GraphXML is a graph description language in XML that can be used as an interchange format for graph drawing and visualization packages. The generality and rich features of XML mak...
GD
2000
Springer
13 years 11 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The GRIP system is designed for drawing large graphs and uses a novel multi-dimensional ...
GD
2000
Springer
13 years 11 months ago
2000
Springer
GD
2000
Springer
13 years 11 months ago
2000
Springer
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of ...
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
GD
2000
Springer
13 years 11 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...