Chapter

Drawing Graphs

Volume 2025 of the series Lecture Notes in Computer Science pp 121-171

Date:

Orthogonal Graph Drawing

  • Markus EiglspergerAffiliated withInstitut für Informatik, Universität Tübingen
  • , Sándor P. FeketeAffiliated withTechnische Universität Berlin, Fachbereich Mathematik
  • , Gunnar W. KlauAffiliated withTechnische Universität Wien E186, Abteilung für Algorithmen und Datenstrukturen

* Final gross prices may vary according to local VAT.

Get Access

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.