Results 1  10
of
19
On the Computational Complexity of Upward and Rectilinear Planarity Testing (Extended Abstract)
, 1994
"... A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction, and no two edges cross. An undirected graph is rectilinear planar if it can be drawn in the plane such that every edge is a horizontal or vertical se ..."
Abstract

Cited by 84 (4 self)
 Add to MetaCart
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction, and no two edges cross. An undirected graph is rectilinear planar if it can be drawn in the plane such that every edge is a horizontal or vertical segment, and no two edges cross. Testing upward planarity and rectilinear planarity are fundamental problems in the effective visualization of various graph and network structures. In this paper we show that upward planarity testing and rectilinear planarity testing are NPcomplete problems. We also show that it is NPhard to approximate the minimum number of bends in a planar orthogonal drawing of an nvertex graph with an O(n 1\Gammaffl ) error, for any ffl ? 0.
Drawing Planar Graphs Using the Canonical Ordering
 ALGORITHMICA
, 1996
"... We introduce a new method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. Using this method linear time and space algorithms can be designed for m ..."
Abstract

Cited by 67 (0 self)
 Add to MetaCart
We introduce a new method to optimize the required area, minimum angle and number of bends of planar drawings of graphs on a grid. The main tool is a new type of ordering on the vertices and faces of triconnected planar graphs. Using this method linear time and space algorithms can be designed for many graph drawing problems.  Every triconnected planar graph G can be drawn convexly with straight lines on an (2n \Gamma 4) \Theta (n \Gamma 2) grid, where n is the number of vertices.  Every triconnected planar graph with maximum degree four can be drawn orthogonally on an n \Theta n grid with at most d 3n 2 e + 4, and if n ? 6 then every edge has at most two bends.  Every 3planar graph G can be drawn with at most b n 2 c + 1 bends on an b n 2 c \Theta b n 2 c grid.  Every triconnected planar graph G can be drawn planar on an (2n \Gamma 6) \Theta (3n \Gamma 9) grid with minimum angle larger than 2 d radians and at most 5n \Gamma 15 bends, with d the maximum d...
A Better Heuristic for Orthogonal Graph Drawings
 COMPUT. GEOM. THEORY APPL
, 1998
"... An orthogonal drawing of a graph is an embedding in the plane such that all edges are drawn as sequences of horizontal and vertical segments. We present a linear time and space algorithm to draw any connected graph orthogonally on a grid of size n \Theta n with at most 2n + 2 bends. Each edge is ben ..."
Abstract

Cited by 64 (6 self)
 Add to MetaCart
An orthogonal drawing of a graph is an embedding in the plane such that all edges are drawn as sequences of horizontal and vertical segments. We present a linear time and space algorithm to draw any connected graph orthogonally on a grid of size n \Theta n with at most 2n + 2 bends. Each edge is bent at most twice. In particular for nonplanar and nonbiconnected planar graphs, this is a big improvement. The algorithm is very simple, easy to implement, and it handles both planar and nonplanar graphs at the same time.
ThreeDimensional Orthogonal Graph Drawing
, 2000
"... vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . ..."
Abstract

Cited by 27 (10 self)
 Add to MetaCart
vi Declaration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii List of Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiv I Orthogonal Graph Drawing 1 1
Algorithms for Drawing Clustered Graphs
, 1997
"... In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
In the mid 1980s, graphics workstations became the main platforms for software and information engineers. Since then, visualization of relational information has become an essential element of software systems. Graphs are commonly used to model relational information. They are depicted on a graphics workstation as graph drawings. The usefulness of the relational model depends on whether the graph drawings effectively convey the relational information to the users. This thesis is concerned with finding good drawings of graphs. As the amount of information that we want to visualize becomes larger and the relations become more complex, the classical graph model tends to be inadequate. Many extended models use a node hierarchy to help cope with the complexity. This thesis introduces a new graph model called the clustered graph. The central theme of the thesis is an investigation of efficient algorithms to produce good drawings for clustered graphs. Although the criteria for judging the qua...
Algorithms for AreaEfficient Orthogonal Drawings
 Computational Geometry: Theory and Applications
, 1996
"... An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then t ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then the drawing produced by our first algorithm needs area at most (roughly) 0:76n 2 , and introduces at most 2n + 2 bends. Also, each edge of such a drawing has at most two bends. Our algorithm is based on forming and placing pairs of vertices of the graph. If the maximum degree is three, then the drawing produced by our second algorithm needs at most (roughly) 1 4 n 2 area and, if the graph is biconnected, at most b n 2 c + 3 bends. These upper bounds match the upper bounds known for planar graphs of maximum degree 3. This algorithm produces optimal drawings (within a constant of 2) with respect to the number of bends, since there is a lower bound of n 2 + 1 in the number of bends fo...
An Experimental Comparison of Three Graph Drawing Algorithms (Extended Abstract)
, 1995
"... In this paper we present an extensive experimental study... ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
In this paper we present an extensive experimental study...
Issues in Interactive Orthogonal Graph Drawing
, 1995
"... . Several applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing gives the user the ability to dynamically interact with the drawing. In this paper we discuss features that are essential f ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. Several applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing gives the user the ability to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive drawing system. We also describe some possible interactive drawing scenaria and present results on two of them. In these results we assume that the underline drawing is always orthogonal and the maximum degree of any vertex is at most four at the end of any update operation. 1 Introduction Graphs have been extensively used to represent various important concepts or objects. Examples of such objects include parallel computer architectures, networks, state graphs, entityrelationship diagrams, subroutine call graphs, automata, dataflow graphs, Petri nets, VLSI circuits, etc. In all of these cases, we require that the graph be represented (or drawn) in the plane so that we c...
Interactive Orthogonal Graph Drawing
 Proc. of GD '95
, 1996
"... Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interacti ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenaria, present results on two of them, and compare their performance. Research supported in part by NIST, Advanced Technology Program grant number 70NANB5H1162. 1 Introduction Graphs have been extensively used to represent various important concepts or objects. Examples include parallel computer architectures, networks, state graphs, entityrelationship diagrams, subroutine call graphs, automata, dataflow graphs, Petri nets, VLSI circuits, etc. In all of these cases, we require that the graph be represented (or drawn) in the plane so that we can understand and study its structure and properties. I...
Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends
 Proc. Algorithms and Data Structures: 5th International Workshop (WADS'97), volume 1272 of Lecture Notes in Cornput. Sci
, 1996
"... Most of the work that appears in the orthogonal graph drawing literature deals with graphs whose maximum degree is four. In this paper we present an algorithm for orthogonal drawings of simple graphs with degree higher than four. Vertices are represented by rectangular boxes of perimeter less than t ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Most of the work that appears in the orthogonal graph drawing literature deals with graphs whose maximum degree is four. In this paper we present an algorithm for orthogonal drawings of simple graphs with degree higher than four. Vertices are represented by rectangular boxes of perimeter less than twice the degree of the vertex. Our algorithm is based on creating groups/pairs of vertices of the graph both ahead of time and in real drawing time. The orthogonal drawings produced by our algorithm have area at most (m 1) * (m/2 +2). Two important properties of our algorithm are that the drawings exhibit small total number of bends (less than m), and that there is at most one bend per edge.