Results 1  10
of
35
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 68 (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...
StraightLine Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
 Algorithmica
, 1999
"... Hierarchical graphs and clustered graphs are useful nonclassical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualizatio ..."
Abstract

Cited by 60 (12 self)
 Add to MetaCart
Hierarchical graphs and clustered graphs are useful nonclassical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization, and VLSI design. Drawing algorithms for hierarchical graphs have been well investigated. However, the problem of straightline representation has not been solved completely. In this paper, we answer the question: does every planar hierarchical graph admit a planar straightline hierarchical drawing? We present an algorithm that constructs such drawings in linear time. Also, we answer a basic question for clustered graphs, that is, does every planar clustered graph admit a planar straightline drawing with clusters drawn as convex polygons? We provide a method for such drawings based on our algorithm for hierarchical graphs.
Convex Grid Drawings of 3Connected Planar Graphs
, 1994
"... We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. We present a lineartime algorithm which, given an nvertex 3connected plane gr ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. We present a lineartime algorithm which, given an nvertex 3connected plane graph G (with n 3), finds such a straightline convex embedding of G into a (n \Gamma 2) \Theta (n \Gamma 2) grid. 1 Introduction In this paper we consider the problem of aesthetic drawing of plane graphs, that is, planar graphs that are already embedded in the plane. What is exactly an aesthetic drawing is not precisely defined and, depending on the application, different criteria have been used. In this paper we concentrate on the two following criteria: (a) edges should be represented by straightline segments, and (b) faces should be drawn as convex polygons. F'ary [6], Stein [14] and Wagner [18] showed, independently, that each planar graph can be drawn in the plane in such a way that ...
A Lineartime Algorithm for Drawing a Planar Graph on a Grid
 Information Processing Letters
, 1989
"... We present a lineartime algorithm that, given an nvertex planar graph G, finds an embedding of G into a (2n \Gamma 4) \Theta (n \Gamma 2) grid such that the edges of G are straightline segments. 1 Introduction We consider the problem of embedding the vertices of a planar graph into a small grid i ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
We present a lineartime algorithm that, given an nvertex planar graph G, finds an embedding of G into a (2n \Gamma 4) \Theta (n \Gamma 2) grid such that the edges of G are straightline segments. 1 Introduction We consider the problem of embedding the vertices of a planar graph into a small grid in the plane in such a way that the edges are straight, nonintersecting line segments. The existence of such straightline embeddings for planar graphs was independently discovered by F'ary [Fa48], Stein [St51], and Wagner [Wa36]; this result also follows from Steinitz's theorem on convex polytopes in three dimensions [SR34]. The first algorithms for constructing straightline embeddings [Tu63, CYN84, CON85] required highprecision arithmetic, and the resulting drawings were not very aesthetic, since they tend to produce uneven distributions of vertices over the drawing area. Rosenstiehl and Tarjan [RT86] noticed that it would be convenient to be able to map veritices of a planar graph into a...
Convex Drawings of Graphs in Two and Three Dimensions
, 1996
"... We provide O(n)time algorithms for constructing the following types of drawings of nvertex 3connected planar graphs: ffl 2D convex grid drawings with (3n) × (3n/2) area under the edge L 1 resolution rule; ffl 2D strictly convex grid drawings with O(n³) × O(n³) area under the edge resolution ru ..."
Abstract

Cited by 31 (10 self)
 Add to MetaCart
We provide O(n)time algorithms for constructing the following types of drawings of nvertex 3connected planar graphs: ffl 2D convex grid drawings with (3n) × (3n/2) area under the edge L 1 resolution rule; ffl 2D strictly convex grid drawings with O(n³) × O(n³) area under the edge resolution rule; ffl 2D strictly convex drawings with O(1) × O(n) area under the vertexresolution rule, and with vertex coordinates represented by O(n log n)bit rational numbers; ffl 3D convex drawings with O(1) × O(1) × O(n) volume under the vertexresolution rule, and with vertex coordinates represented by O(n log n)bit rational numbers. We also
MinimumWidth Grid Drawings of Plane Graphs
 Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science
, 1995
"... Given a plane graph G, we wish to draw it in the plane in such a way that the vertices of G are represented as grid points, and the edges are represented as straightline segments between their endpoints. An additional objective is to minimize the size of the resulting grid. It is known that each pl ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
Given a plane graph G, we wish to draw it in the plane in such a way that the vertices of G are represented as grid points, and the edges are represented as straightline segments between their endpoints. An additional objective is to minimize the size of the resulting grid. It is known that each plane graph can be drawn in such a way in a (n \Gamma 2) \Theta (n \Gamma 2) grid (for n 3), and that no grid smaller than (2n=3 \Gamma 1) \Theta (2n=3 \Gamma 1) can be used for this purpose, if n is a multiple of 3. In fact, for all n 3, each dimension of the resulting grid needs to be at least b2(n \Gamma 1)=3c, even if the other one is allowed to be unbounded. In this paper we show that this bound is tight by presenting a grid drawing algorithm that produces drawings of width b2(n \Gamma 1)=3c. The height of the produced drawings is bounded by 4b2(n \Gamma 1)=3c \Gamma 1. Our algorithm runs in linear time and is easy to implement. 1 Introduction The problem of automatic graph drawing ha...
Confluent drawings: Visualizing NonPlanar Diagrams in a Planar Way
 GRAPH DRAWING (PROC. GD ’03), VOLUME 2912 OF LECTURE NOTES COMPUT. SCI
, 2003
"... We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing nonplanar graphs in a planar way. This approach allows us to draw, in a crossingfree manner, graphs—such as software interaction diagrams—that would normally have many cro ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing nonplanar graphs in a planar way. This approach allows us to draw, in a crossingfree manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged together and drawn as “tracks” (similar to train tracks). Producing such confluent drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed ones) to test if a nonplanar graph can be drawn efficiently in a confluent way. In addition, we identify several large classes of graphs that can be completely categorized as being either confluently drawable or confluently nondrawable.
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...
Upward Planar Drawing of Single Source Acyclic Digraphs
, 1990
"... A upward plane drawing of a directed acyclic graph is a straight line drawing in the Euclidean plane such that all directed arcs point upwards. Thomassen [30] has given a nonalgorithmic, graphtheoretic characterization of those directed graphs with a single source that admit an upward drawing. We ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
A upward plane drawing of a directed acyclic graph is a straight line drawing in the Euclidean plane such that all directed arcs point upwards. Thomassen [30] has given a nonalgorithmic, graphtheoretic characterization of those directed graphs with a single source that admit an upward drawing. We present an efficient algorithm to test whether a given singlesource acyclic digraph has a plane upward drawing and, if so, to find a representation of one such drawing. The algorithm decomposes the graph into biconnected and triconnected components, and defines conditions for merging the components into an upward drawing of the original graph. For the triconnected components we provide a linear algorithm to test whether a given plane representation admits an upward drawing with the same faces and outer face, which also gives a simpler (and algorithmic) proof of Thomassen's result. The entire testing algorithm (for general single source directed acyclic graphs) operates in O(n²) time and...
Planar Drawings of Plane Graphs
, 2000
"... this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results. ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.