19 search results - page 1 / 4 » Orthogonal Drawings of Series-Parallel Graphs with Minimum B... |
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
GD
2001
Springer
13 years 8 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...
PPL
2000
13 years 4 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
ISCAS
2008
IEEE
13 years 10 months ago
2008
IEEE
arallel Graphs (Extended Abstract) Satoshi Tayu, Kumiko Nomura, and Shuichi Ueno Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-...
GD
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...