Abstract

An orthogonal drawing of a graph is an embedding in the plane such
that all edges are drawn as sequences of horizontal and vertical segments.
We present a linear time and space algorithm to draw any connected graph
orthogonally on a grid of size n n with at most 2n + 2
... read more