Advertisement

Drawing Graphs pp 121-171 | Cite as

Orthogonal Graph Drawing

  • Markus Eiglsperger
  • Sándor P. Fekete
  • Gunnar W. Klau
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2025)

Abstract

There are various criteria to judge the qualityof a drawing of a graph. From a human point of view, one of the most important issues is the readabilityo f a drawing: ideally, it should be easy to understand the structure of a graph with just a few glances, and the chance of confusion over connections between different vertices should be small. From an algorithmic point of view, it is necessary to capture this qualityb ymea ns of an objective function. Various objective functions have been studied, with a great deal of effort put into their optimization bym eans of combinatorial algorithms.

Keywords

Planar Graph Shape Description Constraint Graph Graph Drawing Edge Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Markus Eiglsperger
    • 1
  • Sándor P. Fekete
    • 2
  • Gunnar W. Klau
    • 3
  1. 1.Institut für InformatikUniversität TübingenTübingenGermany
  2. 2.Technische Universität BerlinFachbereich MathematikBerlinGermany
  3. 3.Technische Universität Wien E186Abteilung für Algorithmen und DatenstrukturenWienAustria

Personalised recommendations