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 veryw ell in practice.