An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
Abstract. In this paper, we present an object-oriented design and implementation of the core steps of the giotto algorithm for orthogonal graph drawing. Our design is motivated by ...
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...