Sciweavers

Share
19 search results - page 1 / 4
» Orthogonal Drawings of Series-Parallel Graphs with Minimum B...
Sort
View
ISAAC
2005
Springer
131views Algorithms» more  ISAAC 2005»
10 years 7 months ago
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends
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...
Xiao Zhou, Takao Nishizeki
GD
2001
Springer
10 years 6 months ago
Orthogonal Drawings of Plane Graphs without Bends
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...
Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
PPL
2000
91views more  PPL 2000»
10 years 1 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
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 ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
ISCAS
2008
IEEE
140views Hardware» more  ISCAS 2008»
10 years 8 months ago
On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract)
arallel Graphs (Extended Abstract) Satoshi Tayu, Kumiko Nomura, and Shuichi Ueno Department of Communications and Integrated Systems, Tokyo Institute of Technology, Tokyo 152-8550-...
Satoshi Tayu, Kumiko Nomura, Shuichi Ueno
GD
1998
Springer
10 years 5 months ago
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
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...
David R. Wood
books