## Graph Drawing: 6th International Symposium, GD '98 Montreal, Canada, August 13-15, 1998 ProceedingsGraphdrawingaddressestheproblemofconstructingrepresentationsofabstract 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. |

### What people are saying - Write a review

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

### Contents

Drawing of TwoDimensional Irregular Meshes | 1 |

QuasiUpward Planarity | 15 |

Three Approaches to 3DOrthogonal BoxDrawings | 30 |

Using Graph Layout to Visualize Train Interconnection Data | 44 |

Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms | 57 |

Faces Are More than Polygons | 72 |

A SplitPush Approach to 3D Orthogonal Drawing | 87 |

Geometric Thickness of Complete Graphs | 102 |

An Algorithm for ThreeDimensional Orthogonal Graph Drawing | 332 |

Finding Nice Drawings Without Defining Nice | 347 |

Edge Labeling in the Graph Layout Toolkit | 356 |

Improved ForceDirected Layouts | 364 |

A Fully Animated Interactive System for Clustering and Navigating Huge Graphs | 374 |

Drawing Large Graphs with H3Viewer and Site Manager | 384 |

Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor | 394 |

Visualization of Parallel Execution Graphs | 403 |

Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs | 111 |

The 4MAlgorithm | 125 |

Algorithmic Patterns for Orthogonal Graph Drawing | 138 |

A Framework for Drawing Planar Graphs with Curves and Polylines | 153 |

Planar Polyline Drawings with Good Angular Resolution | 167 |

A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order | 183 |

Drawing Algorithms for SeriesParallel Digraphs in Two and Three Dimensions | 198 |

Approximation Algorithms for Finding Best Viewpoints | 210 |

Level Planarity Testing in Linear Time | 224 |

Crossing Number of Abstract Topological Graphs | 238 |

SelfOrganizing Graphs A Neural Network Perspective of Graph Layout | 246 |

Embedding Planar Graphs at Fixed Vertex Locations | 263 |

Three Dimensions Are Better than Two | 275 |

NPCompleteness of Some TreeClustering Problems | 288 |

Refinement of Orthogonal Graph Drawings | 302 |

A Combinatorial Framework for Map Labeling | 316 |

Java Interactive Graph Layout Environment | 413 |

GraphDrawing Contest Report | 423 |

Implementation of an Efficient Constraint Solver for the Layout of Graphs in Delaunay | 436 |

Planar Drawings of Origami Polyhedra | 438 |

Human Perception of LaidOut Graphs | 441 |

The Web Cartographer | 444 |

Flexible Graph Layout and Editing for Commercial Applications | 446 |

A Tool for Visualizing and Animating Automata and Formal Languages | 450 |

Elastic Labels on the Perimeter of a Rectangle | 452 |

Visualizing Graphs Through Java | 454 |

The Size of the Open Sphere of Influence Graph in Metric Spaces | 458 |

Maximum Weight Triangulation and Graph Drawing | 460 |

Adding Constraints to an Algorithm for Orthogonal Graph Drawing | 462 |

On Computing and Drawing MaxminHeight Covering Triangulation | 464 |

Author Index | 467 |

### Other editions - View all

Graph Drawing: 6th International Symposium, GD '98 Montreal, Canada, August ... Sue H. Whitesides No preview available - 1999 |

### Common terms and phrases

aesthetic angular resolution applications aspect ratio Battista bends per edge Berlin Heidelberg 1998 Bézier curves clustered graph components Computer Science constraints construct convex convex hull coordinates corresponding curve cycle defined denote digraph distance Eades edge crossings edge length edge route endpoints example geometric graph drawing graph drawing algorithms graph G graph layout grid drawing heuristic I. G. Tollis implementation input interactive intersect iterations Label Label Label layer Lecture Notes Lemma level planar linear LNCS lower bound method metric nodes Notes in Computer NP-complete NP-hard number of bends optimal orthogonal drawing orthogonal graph drawing path planar graph plane points polygonal polyline PQ-tree problem quasi-upward planar drawing rectangle reduce region represented S.H. Whitesides saturating edge split Springer-Verlag Berlin Heidelberg st-digraph subgraph Tamassia technique Theorem three-dimensional tree clustering undirected graphs upward planar embedded vertex viewpoint visualization volume y-coordinate