Implementing a general-purpose edge router

  • David P. Dobkin
  • Emden R. Gansner
  • Eleftherios Koutsofios
  • Stephen C. North
Methodologies and Applications I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)

Abstract

Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains such as VLSI CAD and robotics, where physical constraints play a major role, aesthetics play the more important role in graph layout. For graphs, we seek paths that are easy to follow and add meaning to the layout. We describe a collection of aesthetic attributes applicable to drawing edges in graphs, and present a general approach for routing individual edges subject to these principles. We also give implementation details and survey difficulties that arise in an implementation.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • David P. Dobkin
    • 1
  • Emden R. Gansner
    • 2
  • Eleftherios Koutsofios
    • 2
  • Stephen C. North
    • 2
  1. 1.Princeton UniversityPrincetonUSA
  2. 2.AT&T LaboratoriesFlorham ParkUSA

Personalised recommendations