This book constitutes the strictly refereed post-conference proceedings of the International Symposium on Graph Drawing, GD'96, held in Berkeley, California, in September 1996.
The 24 revised full papers and the 8 systems demonstrations presented in the book were carefully selected from a total of 50 papers and 24 demos submitted. Also included is a summary of the annual graph drawing competition. Among the topics covered are planarity, upward and orthogonal drawing, heuristics, experimental results, and graph drawing systems.
Author(s): M. Abellanas, J. García, G. Hernández, M. Noy, P. Ramos (auth.), Stephen North (eds.)
Series: Lecture Notes in Computer Science 1190
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 415
Tags: Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Computer Graphics; Combinatorics; Visualization
Bipartite embeddings of trees in the plane....Pages 1-10
Series-parallel planar ordered sets have pagenumber two....Pages 11-24
On rectangle visibility graphs....Pages 25-44
A graph drawing and translation service on the WWW....Pages 45-52
Drawing 2-, 3- and 4-colorable graphs in O(n 2 ) volume....Pages 53-62
Optimizing area and aspect ratio in straight-line orthogonal tree drawings....Pages 63-75
Drawing directed acyclic graphs: An experimental study....Pages 76-91
Circular layout in the Graph Layout toolkit....Pages 92-100
Multilevel visualization of clustered graphs....Pages 101-112
Straight-line drawing algorithms for hierarchical graphs and clustered graphs....Pages 113-128
Graph-Drawing contest report....Pages 129-138
Two algorithms for three dimensional orthogonal graph drawing....Pages 139-154
2-Visibility drawings of planar graphs....Pages 155-168
Upper bounds on the number of hidden nodes in Sugiyama's algorithm....Pages 169-183
Integration of declarative approaches (System Demonstration)....Pages 184-192
GIOTTO3D: A system for visualizing hierarchical structures in 3D....Pages 193-200
A new minimum cost flow algorithm with applications to graph drawing....Pages 201-216
Constrained graph layout....Pages 217-232
The graphlet system (system demonstration)....Pages 233-240
On the Edge Label Placement problem....Pages 241-256
Intersection graphs of noncrossing arc-connected sets in the plane....Pages 257-270
Wiring edge-disjoint layouts....Pages 271-285
Proximity drawings of outerplanar graphs (extended abstract)....Pages 286-302
Automatic visualization of two-dimensional cellular complexes....Pages 303-317
An alternative method to crossing minimization on hierarchical graphs....Pages 318-333
A linear-time algorithm for four-partitioning four-connected planar graphs....Pages 334-344
Graphs drawn with few crossings per edge....Pages 345-354
A pairing technique for area-efficient orthogonal drawings (extended abstract)....Pages 355-370
Experimental and theoretical results in interactive orthogonal graph drawing....Pages 371-386
An interactive system for drawing graphs....Pages 387-394
Automatic graph clustering (system demonstration)....Pages 395-400
Qualitative visualization of processes: Attributed graph layout and focusing techniques....Pages 401-408
