Skip to main content
Conference ProceedingsOPEN ACCESS

Interactive orthogonal graph drawing: Algorithms and bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1353 111-123
DOI: 10.1007/3-540-63938-1_55
8Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Fößmeier, U. (1997). Interactive orthogonal graph drawing: Algorithms and bounds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1353, pp. 111–123). Springer Verlag. https://doi.org/10.1007/3-540-63938-1_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free