32 search results - page 3 / 7 » Refinement of Orthogonal Graph Drawings |
GD
2000
Springer
13 years 10 months ago
2000
Springer
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...
GD
2001
Springer
13 years 10 months ago
2001
Springer
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...
GD
1998
Springer
13 years 10 months ago
1998
Springer
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 ...
GD
1997
Springer
13 years 10 months ago
1997
Springer
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...
ISCAS
2006
IEEE
14 years 10 days ago
2006
IEEE
