Graph Drawing [electronic resource] : 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers / edited by Michael Kaufmann, Dorothea Wagner.Material type: TextLanguage: English Series: Lecture Notes in Computer Science: 4372Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XIV, 454 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540709046Subject(s): Computer science | Data structures (Computer science) | Computer software | Computational complexity | Computer graphics | Computer Science | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Computer Graphics | Data StructuresAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA76.9.M35 Online resources: Click here to access online
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.
The 14th International Symposium on Graph Drawing (GD 2006) was held in Karlsruhe, Germany, during September 17-20, 2006. The conference attracted 108 participants from 18 countries. In response to the call for papers, the Program Committee received 91 s- missions by (co)-authors from 31 countries. At least three Program Committee members reviewed each submission, and after an intensive evaluation phase, the Program Committee selected 33 long papers, 5 short papers, as well as one s- tem demo and 3 posters. The authors receivedextensive comments and excerpts from the discussion on their papers. The best paper award went to Jan Arne Telle and David R. Wood for their paper with the title “Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. ” The Chairs of the conference invited two distinguished lecturers: Emo Welzl from the ETH in Zur ¨ ich gave a very nice and inspiring presentation on “The Number of Crossing-Free Con?gurations in Planar Point-Sets. ” Oliver Deussen fromthe Universit¨ atKonstanztalkedabout“TheAlgorithmicBeautyofVirtual Nature. ” Abstracts of the two invited lectures can also be found in this volume. An ambitious graph drawing contest took place this year under the guidance of Christian Duncan, who also included a report in this volume. In the so- ware exhibition the industrial sponsors of the conference, Tom Sawyer Software, yWorks GmbH and ILOG Inc. , had the chance to provide a closer look at the products and developments.