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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Eiglsperger, M., Fekete, S.P., Klau, G.W. (2001). Orthogonal Graph Drawing. In: Kaufmann, M., Wagner, D. (eds) Drawing Graphs. Lecture Notes in Computer Science, vol 2025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44969-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-44969-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42062-0
Online ISBN: 978-3-540-44969-0
eBook Packages: Springer Book Archive