Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Drawable and forbidden minimum weight triangulations Read chapter Read first chapter

1997 | ReviewPaper | Chapter

Interactive orthogonal graph drawing: Algorithms and bounds

Author : Ulrich Fößmeier

Published in: Graph Drawing

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Incremental graph drawing is a model gaining more and more importance in many applications. We present algorithms that allow insertions of new vertices into an existing drawing without changing the position of the objects drawn so far. We prove bounds for the quality of our drawings and considerably improve on previous bounds. Here the number of bends and the used area are our quality measures. Besides we discuss lower bounds for this problem.

previous chapter A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs
next chapter Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
Metadata
Title
Interactive orthogonal graph drawing: Algorithms and bounds
Author
Ulrich Fößmeier
Copyright Year
1997
Publisher
Springer Berlin Heidelberg
Book
Graph Drawing

Print ISBN: 978-3-540-63938-1

Electronic ISBN: 978-3-540-69674-2

Copyright Year: 1997

DOI
https://doi.org/10.1007/3-540-63938-1_55