Graph Drawing 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers /

Graph Drawing 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers /

Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Kaufmann, Michael (Editor), Wagner, Dorothea (Editor)
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Series:Lecture Notes in Computer Science, 4372
Subjects:
Computer science.
Data structures (Computer science).
Algorithms.
Computer science > Mathematics.
Computer graphics.
Computer Science.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Data Structures.
Online Access:Full Text via HEAL-Link
Table of Contents:
  • Invited Talks
  • The Number of Triangulations on Planar Point Sets
  • The Algorithmic Beauty of Digital Nature
  • Papers
  • Integrating Edge Routing into Force-Directed Layout
  • Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree
  • SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
  • Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
  • Angle and Distance Constraints on Tree Drawings
  • Schematisation of Tree Drawings
  • Trees with Convex Faces and Optimal Angles
  • Three-Dimensional Drawings of Bounded Degree Trees
  • Simultaneous Graph Embedding with Bends and Circular Arcs
  • Embedding Graphs Simultaneously with Fixed Edges
  • Drawing Cubic Graphs with at Most Five Slopes
  • Planarity Testing and Optimal Edge Insertion with Embedding Constraints
  • Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs
  • Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
  • On the Crossing Number of Almost Planar Graphs
  • On the Decay of Crossing Numbers
  • How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm
  • Computing Geometric Minimum-Dilation Graphs Is NP-Hard
  • Chordal Graphs as Intersection Graphs of Pseudosegments
  • Parameterized st-Orientations of Graphs: Algorithms and Experiments
  • Straight-Line Drawing of Quadrangulations
  • Visualizing Large and Clustered Networks
  • Partitioned Drawings
  • Path Simplification for Metro Map Layout
  • Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
  • Upright-Quad Drawing of st-Planar Learning Spaces
  • Choosing Colors for Geometric Graphs Via Color Space Embeddings
  • Morphing Planar Graphs in Spherical Space
  • k-Colored Point-Set Embeddability of Outerplanar Graphs
  • Thickness of Bar 1-Visibility Graphs
  • A New Approximation Algorithm for Bend Minimization in the Kandinsky Model
  • Radial Drawings of Graphs: Geometric Constraints and Trade-Offs
  • Characterization of Unlabeled Level Planar Trees
  • Drawing Bipartite Graphs on Two Curves
  • Improved Circular Layouts
  • Controllable and Progressive Edge Clustering for Large Networks
  • Biclique Edge Cover Graphs and Confluent Drawings
  • Schnyder Woods and Orthogonal Surfaces
  • Partitions of Graphs into Trees
  • Posters
  • The Website for Graph Visualization Software References (GVSR)
  • Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings
  • Corrections
  • Fast Node Overlap Removal—Correction
  • Graph Drawing Contest
  • Graph-Drawing Contest Report.

Similar Items