32 search results - page 2 / 7 » Refinement of Orthogonal Graph Drawings |
GD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...
PPL
2000
13 years 5 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 ...
GD
1998
Springer
13 years 9 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...
JGAA
1998
13 years 5 months ago
1998
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...
ISCAS
2008
IEEE
13 years 12 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-...