Brown University Computer Science Box 1910, Providence; 2; Dipartimento di Informatica e Sistemistica Universita di Roma La Sapienza, Via Salaria,; 3; Brown University Computer Science Box 1910, Providence; 4; Department of Computer Science The Un
RI 02912; 113- Rome, Italy 00198; RI 02912; Richardson, Texas; 75083-0688
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, 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.