SpringerLink
Log in

Graph Drawing

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

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Michael Kaufmann
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Dorothea Wagner
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4372)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: GD 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (45 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. The Number of Triangulations on Planar Point Sets

      • Emo Welzl
      Pages 1-4

    2. The Algorithmic Beauty of Digital Nature

      • Oliver Deussen
      Pages 5-7

  3. Papers

    1. Integrating Edge Routing into Force-Directed Layout

      • Tim Dwyer, Kim Marriott, Michael Wybrow
      Pages 8-19

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

      • Ulrich Lauther
      Pages 20-29

    3. SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding

      • Ali Çivril, Malik Magdon-Ismail, Eli Bocek-Rivele
      Pages 30-41

    4. Eigensolver Methods for Progressive Multidimensional Scaling of Large Data

      • Ulrik Brandes, Christian Pich
      Pages 42-53

    5. Angle and Distance Constraints on Tree Drawings

      • Ulrik Brandes, Barbara Schlieper
      Pages 54-65

    6. Schematisation of Tree Drawings

      • Joachim Gudmundsson, Marc van Kreveld, Damian Merrick
      Pages 66-76

    7. Trees with Convex Faces and Optimal Angles

      • Josiah Carlson, David Eppstein
      Pages 77-88

    8. Three-Dimensional Drawings of Bounded Degree Trees

      • Fabrizio Frati, Giuseppe Di Battista
      Pages 89-94

    9. Simultaneous Graph Embedding with Bends and Circular Arcs

      • Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
      Pages 95-107

    10. Embedding Graphs Simultaneously with Fixed Edges

      • Fabrizio Frati
      Pages 108-113

    11. Drawing Cubic Graphs with at Most Five Slopes

      • Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
      Pages 114-125

    12. Planarity Testing and Optimal Edge Insertion with Embedding Constraints

      • Carsten Gutwenger, Karsten Klein, Petra Mutzel
      Pages 126-137

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

      • Kazuyuki Miura, Tetsuya Matsuno, Takao Nishizeki
      Pages 138-149

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

      • David R. Wood, Jan Arne Telle
      Pages 150-161

    15. On the Crossing Number of Almost Planar Graphs

      • Petr Hliněný, Gelasio Salazar
      Pages 162-173

    16. On the Decay of Crossing Numbers

      • Jacob Fox, Csaba D. Tóth
      Pages 174-183

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

      • Helen C. Purchase, Eve Hoggan, Carsten Görg
      Pages 184-195
Back to top

Other volumes

  1. Graph Drawing

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation