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

Bibliographic Details
Other Authors: Whitesides, Sue H. (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1998, 1998
Edition:1st ed. 1998
Series:Lecture Notes in Computer Science
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Papers
  • Drawing of Two-Dimensional Irregular Meshes
  • Quasi-Upward Planarity
  • Three Approaches to 3D-Orthogonal Box-Drawings
  • Using Graph Layout to Visualize Train Interconnection Data
  • Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
  • Upward Planarity Checking: “Faces Are More than Polygons”
  • A Split&Push Approach to 3D Orthogonal Drawing
  • Geometric Thickness of Complete Graphs
  • Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
  • On Improving Orthogonal Drawings: The 4M-Algorithm
  • Algorithmic Patterns for Orthogonal Graph Drawing
  • A Framework for Drawing Planar Graphs with Curves and Polylines
  • Planar Polyline Drawings with Good Angular Resolution
  • A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order
  • Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
  • Approximation Algorithms for Finding Best Viewpoints
  • Level Planarity Testing in Linear Time
  • Implementation of an Efficient Constraint Solver for the Layout of Graphs in Delaunay
  • Planar Drawings of Origami Polyhedra
  • Human Perception of Laid-Out Graphs
  • Ptolomaeus:The Web Cartographer
  • Flexible Graph Layout and Editing for Commercial Applications
  • Multidimensional Outlines — Wordgraphs
  • VisA: A Tool for Visualizing and Animating Automata and Formal Languages
  • Elastic Labels on the Perimeter of a Rectangle
  • VGJ: Visualizing Graphs Through Java
  • A Library of Algorithms for Graph Drawing
  • The Size of the Open Sphere of Influence Graph in L ? Metric Spaces
  • Maximum Weight Triangulation and Graph Drawing
  • Adding Constraints to an Algorithm for Orthogonal Graph Drawing
  • On Computing and Drawing Maxmin-Height Covering Triangulation
  • Crossing Number of Abstract Topological Graphs
  • Self-Organizing Graphs — A Neural Network Perspective of Graph Layout
  • Embedding Planar Graphs at Fixed Vertex Locations
  • Proximity Drawings: Three Dimensions Are Better than Two
  • NP-Completeness of Some Tree-Clustering Problems
  • Refinement of Orthogonal Graph Drawings
  • A Combinatorial Framework for Map Labeling
  • An Algorithm for Three-Dimensional Orthogonal Graph Drawing
  • System Demonstrations
  • Graph Multidrawing: Finding Nice Drawings Without Defining Nice
  • Edge Labeling in the Graph Layout Toolkit
  • Improved Force-Directed Layouts
  • A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
  • Drawing Large Graphs with H3Viewer and Site Manager
  • Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor.-Visualization of Parallel Execution Graphs
  • JIGGLE: Java Interactive Graph Layout Environment
  • Contest
  • Graph-Drawing Contest Report
  • Poster Abstracts