Graph Drawing

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

Editors:

ISBN: 978-3-540-70903-9 (Print) 978-3-540-70904-6 (Online)

Table of contents (45 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-4

      The Number of Triangulations on Planar Point Sets

    2. No Access

      Book Chapter

      Pages 5-7

      The Algorithmic Beauty of Digital Nature

  3. Papers

    1. No Access

      Book Chapter

      Pages 8-19

      Integrating Edge Routing into Force-Directed Layout

    2. No Access

      Book Chapter

      Pages 20-29

      Multipole-Based Force Approximation Revisited – A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree

    3. No Access

      Book Chapter

      Pages 30-41

      SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding

    4. No Access

      Book Chapter

      Pages 42-53

      Eigensolver Methods for Progressive Multidimensional Scaling of Large Data

    5. No Access

      Book Chapter

      Pages 54-65

      Angle and Distance Constraints on Tree Drawings

    6. No Access

      Book Chapter

      Pages 66-76

      Schematisation of Tree Drawings

    7. No Access

      Book Chapter

      Pages 77-88

      Trees with Convex Faces and Optimal Angles

    8. No Access

      Book Chapter

      Pages 89-94

      Three-Dimensional Drawings of Bounded Degree Trees

    9. No Access

      Book Chapter

      Pages 95-107

      Simultaneous Graph Embedding with Bends and Circular Arcs

    10. No Access

      Book Chapter

      Pages 108-113

      Embedding Graphs Simultaneously with Fixed Edges

    11. No Access

      Book Chapter

      Pages 114-125

      Drawing Cubic Graphs with at Most Five Slopes

    12. No Access

      Book Chapter

      Pages 126-137

      Planarity Testing and Optimal Edge Insertion with Embedding Constraints

    13. No Access

      Book Chapter

      Pages 138-149

      Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs

    14. No Access

      Book Chapter

      Pages 150-161

      Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor

    15. No Access

      Book Chapter

      Pages 162-173

      On the Crossing Number of Almost Planar Graphs

    16. No Access

      Book Chapter

      Pages 174-183

      On the Decay of Crossing Numbers

    17. No Access

      Book Chapter

      Pages 184-195

      How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm

    18. No Access

      Book Chapter

      Pages 196-207

      Computing Geometric Minimum-Dilation Graphs Is NP-Hard

previous Page of 3