Skip to main content
Conference ProceedingsOPEN ACCESS

Fast compaction for orthogonal drawings with vertices of prescribed size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2265 LNCS 124-138
DOI: 10.1007/3-540-45848-4_11
19Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for manypractical applications like UML. The algorithm provides a drastic improvement on previous approaches. It has linear worst case running time and experiments show that it performs verywell in practice. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Eiglsperger, M., & Kaufmann, M. (2002). Fast compaction for orthogonal drawings with vertices of prescribed size. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2265 LNCS, pp. 124–138). Springer Verlag. https://doi.org/10.1007/3-540-45848-4_11

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