+612 9045 4394
Graph Drawing : 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings - Sue H. Whitesides

Graph Drawing

6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 Proceedings

By: Sue H. Whitesides (Editor)


Published: 5th January 1999
Ships: 15 business days
15 business days
or 4 easy payments of $39.60 with Learn more

Graphdrawingaddressestheproblemofconstructingrepresentationsofabstract graphs, networks, and hypergraphs. The 6th Symposium on Graph Drawing (GD '98) was held August 13{15, 1998, atMcGillUniversity, Montr eal, Canada.ItimmediatelyfollowedtheTenth Canadian Conference on Computational Geometry (CCCG '98), held August 10{12 at McGill. The GD '98 conference attracted 100 paid registrants from academic and industrial institutions in thirteen countries. Roughly half the p- ticipantsalsoattendedCCCG'98.Asinthepast, interactionamongresearchers, practitioners, andstudents fromtheoreticalcomputer science, mathematics, and the application areas of graph drawing continued to be an important aspect of the graph drawing symposium. In response to the call for papers and system demonstrations, the program committee received 57 submissions, of which 10 were demos. Each submission was reviewed by at least 4 members of the program committee, and comments were returnedto the authors.Following extensive email discussions andmultiple rounds of voting, the program committee accepted 23 papers and 9 demos. GD '98 also held an unrefereed poster gallery. The poster gallery contained 16 posters, 14 of which have abstracts in this volume. The poster gallery served to encourageparticipationfromresearchersinrelatedareasandprovidedast- ulating environment for the breaks between the technical sessions. In keeping with the tradition of previous graph drawing conferences, GD '98 held a graph drawing contest. This contest, which is traditionally a conference highlight, servestomonitorandtochallengethestateoftheartingraphdrawing. A report on the 1998 contest appears in this volume.

Drawing of Two-Dimensional Irregular Meshesp. 1
Quasi-Upward Planarityp. 15
Three Approaches to 3D-Orthogonal Box-Drawingsp. 30
Using Graph Layout to Visualize Train Interconnection Datap. 44
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithmsp. 57
Upward Planarity Checking: "Faces Are More than Polygons"p. 72
A Split&Push Approach to 3D Orthogonal Drawingp. 87
Geometric Thickness of Complete Graphsp. 102
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphsp. 111
On Improving Orthogonal Drawings: The 4M-Algorithmp. 125
Algorithmic Patterns for Graph Drawingp. 138
A Framework for Drawing Planar Graphs with Curves and Polylinesp. 153
Planar Polyline Drawings with Good Angular Resolutionp. 167
A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Orderp. 183
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensionsp. 198
Approximation Algorithms for Finding Best Viewpointsp. 210
Level Planarity Testing in Linear Timep. 224
Crossing Number of Abstract Topological Graphsp. 238
Self-Organizing Graphs - A Neural Network Perspective of Graph Layoutp. 246
Embedding Planar Graphs at Fixed Vertex Locationsp. 263
Proximity Drawings: Three Dimensions Are Better than Twop. 275
NP-Completeness of Some Tree-Clustering Problemsp. 288
Refinement of Orthogonal Graph Drawingsp. 302
A Combinatorial Framework for Map Labelingp. 316
An Algorithm for Three-Dimensional Orthogonal Graph Drawingp. 332
System Demonstrations
Graph Multidrawing: Finding Nice Drawings Without Defining Nicep. 347
Edge Labeling in the Graph Layout Toolkitp. 356
Improved Force-Directed Layoutsp. 364
A Fully Animated Interactive System for Clustering and Navigating Huge Graphsp. 374
Drawing Large Graphs with H3Viewer and Site Managerp. 384
Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editorp. 394
Visualization of Parallel Execution Graphsp. 403
JIGGLE: Java Interactive General Graph Layout Environmentp. 413
Graph Drawing Contest Reportp. 423
Poster Abstracts
Implementation of an Efficient Constraint Solver for the Layout of Graphs in Delaunayp. 436
Planar Drawings of Origami Polyhedrap. 438
Human Perception of Laid-Out Graphsp. 441
Ptolomaeus: The Web Cartographerp. 444
Flexible Graph Layout and Editing for Commercial Applicationsp. 446
Multidimensional Outlines - WordgraphsTMp. 448
VisA: A Tool for Visualizing and Animating Automata and Formal Languagesp. 450
Elastic Labels on the Perimeter of a Rectanglep. 452
VGJ: Visualizing Graphs Through Javap. 454
A Library of Algorithms for Graph Drawingp. 456
The Size of the Open Sphere of Influence Graph in L Metric Spacesp. 458
Maximum Weight Triangulation and Graph Drawingp. 460
Adding Constraints to an Algorithm for Orthogonal Graph Drawingp. 462
On Computing and Drawing Maxmin-Height Covering Triangulationp. 464
Author Indexp. 467
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540654735
ISBN-10: 3540654739
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 476
Published: 5th January 1999
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.49
Weight (kg): 0.68