A. Papakostas and I. G. Tollis, Interactive orthogonal graph drawing. IEEE Trans. Comput., 47(11):1297-1309, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in the literature on dynamic graph drawing algorithms. A linear time algorithm for orthogonal drawings is presented in [5] In this algorithm the position of the vertices cannot be changed after the initial placement. Four di#erent scenarios for interactive orthogonal graph drawings are studied in [29]. Each scenario defines the changes allowed in the common part of two consecutive drawings. An interactive version of Giotto [33] is described in [8] it allows the user to incrementally add vertices and edges to an orthogonal drawing in such a way that the shape of the common part of two ....

A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11):1297--1309, 1998.

....have been starting to receive more attention. See, for example, the work of Biedl and Kaufmann [3] Brandes and Wagner [4] Bridgeman et al. 6] Cohen et al. 8] F6Bmeier [12] Miriyala, Hornick, and Tamassia [18] Moen [20] North [21] Papakostas, Six, and Tollis [22] Papakostas and Tollis [23], and Ryall, Marks, and Shieber [26] However, while the algorithms themselves have been motivated by the need to preserve the user s mental map, much of the evaluation of the algorithms has so far focused on traditional optimization criteria such as the area and the number of bends and crossings ....

.... mental map, much of the evaluation of the algorithms has so far focused on traditional optimization criteria such as the area and the number of bends and crossings (see, for example, the analysis in Biedl and Kaufmann [3] F6Bmeier [12] Papakostas, Six, and Tollis [22] and Papakostas and Tollis [23]) Mental map preservation is often achieved by attempting to minimize the change between drawings typically by allowing only very limited modifications (if any) to the position of vertices and edge bends in the existing drawing making it important to be able to measure precisely how much the look ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. In Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Cornput. Sci. Springer- Verlag, 1996.

....for the incremental layout of UML class diagrams. Ryall et al. 32] present a constraint based approach to layout small graphs. These constraints are enforced by a generalized spring algorithm. Several techniques for the preservation of the mental map in orthogonal drawings have been proposed [3, 4, 28]. Papakostas and Tollis [28] discuss a systematic approach that applies to interactive orthogonal graph drawings of vertices of degree at most 4. They describe the following scenarios: 1. Full control scenario. When a new vertex is inserted in the current drawing, the user has full control over ....

....UML class diagrams. Ryall et al. 32] present a constraint based approach to layout small graphs. These constraints are enforced by a generalized spring algorithm. Several techniques for the preservation of the mental map in orthogonal drawings have been proposed [3, 4, 28] Papakostas and Tollis [28] discuss a systematic approach that applies to interactive orthogonal graph drawings of vertices of degree at most 4. They describe the following scenarios: 1. Full control scenario. When a new vertex is inserted in the current drawing, the user has full control over the vertex location. The ....

A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11):1297--1309, 1998.

....that produces 3D orthogonal drawings of simple graphs of arbitrary degree. Note that there has not been any previous work that dealt with the theory of 3 D orthogonal drawing of graphs of arbitrary degree. Both algorithms are based on the RelativeCoordinates paradigm for vertex insertion [25, 26, 28]. As such, both algorithms support interactive environments where vertices arrive and enter the drawing on line. An important feature of this work is that both algorithms guarantee no edge crossings. Given an n vertex graph G of maximum degree 6, our first algorithm produces a 3 D orthogonal ....

....points. Our technique follows the Relative Coordinates scenario. This means that the decision about where a new vertex will be placed and how its incident edges will be routed depends entirely on the free directions around the adjacent vertices. The properties of the Relative Coordinates scenario [25, 26, 28] are also properties of the 3 D drawings produced by our algorithm and guarantee a smooth transition from the current drawing to the next. The notation u # p # p # means that from vertex u we draw a straight line segment that intersects plane p perpendicularly, and from the intersection ....

A. Papakostas and I. G. Tollis, Interactive Orthogonal Graph Drawing, IEEE Transactions on Computers, vol. 47, no. 11 November 1998, pp. 12971309.

No context found.

A. Papakostas and I. G. Tollis, Interactive orthogonal graph drawing. IEEE Trans. Comput., 47(11):1297-1309, 1998.

No context found.

A. Papakostas and I. G. Tollis, Interactive orthogonal graph drawing. IEEE Trans. Comput., 47(11):1297-1309, 1998.

No context found.

A. Papakostas and I. G. Tollis, Interactive orthogonal graph drawing. IEEE Trans. Comput., 47(11):1297-1309, 1998.

No context found.

A. Papakostas and I. G. Tollis, Interactive orthogonal graph drawing. IEEE Trans. Comput., 47(11):1297-1309, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC