GRAPH DRAWING.: Edition en anglais

Front Cover
Springer Science & Business Media, Jan 10, 1996 - Computers - 526 pages
This book constitutes the refereed proceedings of the international Symposium on Graph Drawing, GD '95, held in Passau, Germany, in September 1995.
The 40 full papers and 12 system demonstrations were selected from a total of 88 submissions and include, in their revised versions presented here, the improvements suggested during the meeting. This book also contains a report on the graph-drawing contest held in conjunction with GD '95. Graph drawing is concerned with the problem of visualizing structural information, particularly by constructing geometric representations of abstract graphs and networks. The importance of this area for industrial applications is testified by the large number of people with industrial affiliations, submitting papers and participating in the meeting.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

QuasiPlanar Graphs Have a Linear Number of Edges
1
Universal 3Dimensional Visibility Representations for Graphs
8
KGB A Customizable Graph Browser
20
a Drawing System for Generic Combinatorial Structures
24
New Lower Bounds for Orthogonal Graph Drawings
28
The Effect of Graph Layout on Inference from Social Network Data
40
Drawing Nice Projections of Objects in Space
52
Optimal Algorithms to Embed Trees in a Point Set
64
Grid Embedding of 4Connected Plane Graphs
287
Recognizing LeveledPlanar Dags in Linear Time
300
Contact Graphs of Curves
312
On Representations of Some ThicknessTwo Graphs
324
Drawing ForceDirected Graphs Using Optigraph
333
Exact and Heuristic Algorithms for 2Layer Straightline Crossing Minimization
337
ConstraintBased SpringModel Algorithm for Graph Layout
349
Layout Algorithms of GraphLike Diagrams for GRADE Windows Graphic Editors
361

An Experimental Comparison of ForceDirected and Randomized Graph Drawing Algorithms
76
On the Complexity of Recognizing Intersection and Touching Graphs of Disks
88
Fast Interactive 3D Graph Visualization
99
A System for Prototyping and Testing Graph Drawing Algorithms
111
A Tool for Research and Teaching in Graph Theory
123
Extending Detail and Context Viewing into a Tool for Subgraph Comparisons
127
Upward Numbering Testing for Triconnected Graphs
140
On a Visibility Representation of Graphs
152
3D Graph Drawing with Simulated Annealing
162
The Botanical Beauty of Random Binary Trees
166
The Strength of Weak Proximity Extended Abstract
178
Information Visualization using Cooperative 3D Diagram Layout
190
Vertex Splitting and TensionFree Layout
202
Drawing Stressed Planar Graphs in Three Dimensions
212
GraphDrawing Contest Report
224
New Results on a Visibility Representation of Graphs in 3D
234
Generalized Fisheye Views of Graphs
242
Drawing High Degree Graphs with Low Bend Numbers
254
The Drawing of Configurations
267
Upward Drawings on Planes and Spheres
277
Grid Intersection and Box Intersection Graphs on Surfaces Extended Abstract
365
How to Draw Outerplanar Minimum Weight Triangulations extended abstract
373
Portable Graph Layout and Editing
385
A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs
396
Incremental Layout in DynaDAG
409
Issues in Interactive Orthogonal Graph Drawing Preliminary Version
419
Automatic Drawing of Compound Digraphs for a RealTime Power System Simulator
431
Validating Graph Drawing Aesthetics
435
A Fast Heuristic for Hierarchical Manhattan Layout
447
CLAX A Visualized Compiler
459
Crossing Numbers of Meshes
463
Directed Graphs Drawing by ClanBased Decomposition
472
TOSCANA Management System for Conceptual Data
483
Graph Layout Adjustment Strategies
487
DABDUCTOR
500
Generating Customized Layouts
504
GOVE GrammarOriented Visualisation Environment
516
A Data Structure Visualization System 1
520
Author Index
525
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 499 - work was supported in part by the Natural Sciences and Engineering Research Council of Canada. References 1. G. Di BATTISTA, P. EADES, R. TAMASSIA, AND I. TOLLIS, Algorithms for