Implementing a general-purpose edge router

David P. Dobkin, Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 5th International Symposium, GD 1997, Proceedings
EditorsGiuseppe DiBattista
PublisherSpringer Verlag
Pages262-271
Number of pages10
ISBN (Print)9783540639381
DOIs
StatePublished - Jan 1 1997
Event5th International Symposium on Graph Drawing, GD 1997 - Rome, Italy
Duration: Sep 18 1997Sep 20 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1353
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Symposium on Graph Drawing, GD 1997
CountryItaly
CityRome
Period9/18/979/20/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Implementing a general-purpose edge router'. Together they form a unique fingerprint.

Cite this