Results 1 
3 of
3
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 515 (40 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar graphs. These algorithms adopt a variety of representations (e.g., straightline, polyline, visibility), and update the drawing in a smooth way.
Parallel transitive closure and point location in planar structures
 SIAM J. COMPUT
, 1991
"... Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar stgraphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of th ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar stgraphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal O(log n) running time using n = log n processors in the EREW PRAM model, n being the number of vertices.
Turnregularity and optimal area drawings of orthogonal representations
, 2000
"... Given an orthogonal representation H with n vertices and bends, we study the problem of computing a planar orthogonal drawing of H with small area. This problem has direct applications to the development of practical graph drawing techniques for information visualization and VLSI layout. In this pap ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
Given an orthogonal representation H with n vertices and bends, we study the problem of computing a planar orthogonal drawing of H with small area. This problem has direct applications to the development of practical graph drawing techniques for information visualization and VLSI layout. In this paper, we introduce the concept of turnregularity of an orthogonal representation H, provide combinatorial characterizations of it, and show that if H is turnregular (i.e., all its faces are turnregular), then a planar orthogonal drawing of H with minimum area can be computed in O(n) time, and a planar orthogonal drawing of H with minimum area and minimum total edge length within that area can be computed in O(n 7/4 log n) time. We also apply our theoretical results to the design and implementation of new practical heuristic methods for constructing planar orthogonal drawings. An experimental study conducted on a test suite of orthogonal representations of randomly generated biconnected 4planar graphs shows that the percentage of turnregular faces is quite high and that our heuristic drawing methods perform better than previous ones.