Graph Drawing

7th International Symposium, GD’99 Štiřín Castle, Czech Republic September 15–19, 1999 Proceedings

Editors:

ISBN: 978-3-540-66904-3 (Print) 978-3-540-46648-2 (Online)

Table of contents (44 chapters)

previous Page of 3
  1. Invited Talk

    1. No Access

      Book Chapter

      Pages 1-7

      The Anatomy of a Geometric Algorithm

  2. Orthogonality I

    1. No Access

      Book Chapter

      Pages 8-26

      Turn-Regularity and Planar Orthogonal Drawings

    2. No Access

      Book Chapter

      Pages 27-37

      Combining Graph Labeling and Compaction

    3. No Access

      Book Chapter

      Pages 38-48

      Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time

    4. No Access

      Book Chapter

      Pages 49-58

      Fully Dynamic 3-Dimensional Orthogonal Graph Drawing

  3. Levels I

    1. No Access

      Book Chapter

      Pages 59-71

      An E log E Line Crossing Algorithm for Levelled Graphs

    2. No Access

      Book Chapter

      Pages 72-81

      Level Planar Embedding in Linear Time

    3. No Access

      Book Chapter

      Pages 82-89

      Higres — Visualization System for Clustered Graphs and Graph Algorithms

  4. Clusters I

    1. No Access

      Book Chapter

      Pages 90-97

      Partitioning Approach to Visualization of Large Graphs

    2. No Access

      Book Chapter

      Pages 98-106

      Graph Clustering Using Distance-k Cliques

  5. Drawing I

    1. No Access

      Book Chapter

      Pages 107-116

      A Framework for Circular Drawings of Networks

    2. No Access

      Book Chapter

      Pages 117-126

      Drawing Planar Graphs with Circular Arcs

    3. No Access

      Book Chapter

      Pages 127-136

      Drawing Graphs in the Hyperbolic Plane

  6. Invited Talk

    1. No Access

      Book Chapter

      Pages 137-144

      Graph Planarity and Related Topics

  7. Planarity

    1. No Access

      Book Chapter

      Pages 145-154

      Grid Drawings of Four-Connected Plane Graphs

    2. No Access

      Book Chapter

      Pages 155-164

      Graph Embedding with Topological Cycle-Constraints

    3. No Access

      Book Chapter

      Pages 165-174

      Embedding Vertices at Points: Few Bends Suffice for Planar Graphs

    4. No Access

      Book Chapter

      Pages 175-185

      The Constrained Crossing Minimization Problem

  8. Clusters II

    1. No Access

      Book Chapter

      Pages 186-196

      Planarity-Preserving Clustering and Embedding for Large Planar Graphs

    2. No Access

      Book Chapter

      Pages 197-204

      An Algorithm for Drawing Compound Graphs

previous Page of 3