Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs

Drawing graphs is an important problem that combines elements 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 follow...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing Jg. 24; H. 5; S. 970 - 1001
Hauptverfasser: Cohen, Robert F., Di Battista, Giuseppe, Tamassia, Roberto, Tollis, Ioannis G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Philadelphia, PA Society for Industrial and Applied Mathematics 01.10.1995
Schlagworte:
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science
Computer science; control theory; systems
Exact sciences and technology
Geometry
Graph theory
Graphs
Information retrieval. Graph
Mathematics
Queries
Readability
Sciences and techniques of general use
Theoretical computing
Algorithms
Drawing (graphics)
Planar graph
Dynamic algorithm
Graph drawing
Data structures
Trees (mathematics)
Graph theory
Selection function
Directed graph
ISSN:0097-5397, 1095-7111
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Drawing graphs is an important problem that combines elements 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: * 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. * We present efficient dynamic drawing algorithms for trees and series-parallel digraphs. As further applications of the model, we give dynamic drawing algorithms for planar $st$-digraphs and planar graphs. Our algorithms adopt a variety of representations (e.g., straight line, polyline, visibility) and update the drawing in a smooth way.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539792235724