Name
Abstract | ||
|---|---|---|
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: (i) 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. (ii) We present several efficient dynamic drawing algorithms for trees, series-parallel digraphs, planar st-digraphs, and planar graphs. These algorithms adopt a variety of representations (e.g., straight-line, polyline, visibility), and update the drawing in a smooth way. (iii) We show that the implicit representation of the layout used by our algorithms for trees and series-parallel digraphs also supports point-location and window queries. (Joint work with P. Bertolazzi, G. Di Battista, R. Tamassia, and I. G. Tollis.) |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1145/152992.153006 | ACM SIGACT News |
Keywords | Field | DocType |
planar graph drawing,planar st-digraphs,g. di battista,circuit layout,planar graph,g. tollis,series-parallel digraph,graph theory,new method,efficient dynamic drawing algorithm,implicit representation,dynamic graph algorithm,network management,point location,software engineering,series parallel | Graph drawing,Combinatorics,Outerplanar graph,Computer science,Planar straight-line graph,Force-directed graph drawing,Theoretical computer science,SPQR tree,Book embedding,Lattice graph,Planar graph | Journal |
Volume | Issue | Citations |
24 | 1 | 1 |
PageRank | References | Authors |
0.57 | 0 | 1 |