A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Introduction The recent interest in three dimensional graph drawing has been motivating studies on how to extend two dimensional techniques to 3D space. Work in this direction includes extensions of simulated annealing techniques, spring embedder techniques, and incremental techniques (see e.g. [5, 9, 15, 22, 23, 28]) However, while a rich body of literature is devoted to three dimensional orthogonal drawings (see e.g. 3, 8, 14, 16, 17, 21, 23, 29] little is known on the challenging task of extending to 3D the well known topology shapemetrics approach [26] The topology shape metrics approach for ....

....techniques to 3D space. Work in this direction includes extensions of simulated annealing techniques, spring embedder techniques, and incremental techniques (see e.g. 5, 9, 15, 22, 23, 28] However, while a rich body of literature is devoted to three dimensional orthogonal drawings (see e.g. [3, 8, 14, 16, 17, 21, 23, 29]) little is known on the challenging task of extending to 3D the well known topology shapemetrics approach [26] The topology shape metrics approach for two dimensional space consists of three main steps: In the rst step a planar embedding of the input graph G is de ned. In the second step a ....

Achilleas Papakostas and Ioannis G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. Journal of Graph Algorithms and Applications, 3(4):81-115, 1999.

....graph drawing. Proposed models for three dimensional graph drawing include straightline drawings [14,23,29] convex drawings [12,19] spline curve drawings [24] multilevel drawings of clustered graphs [18] visibility representations [2,10] and of interest in this paper orthogonal drawings [4,6,13,16,20 22,26,28,31,33,38 40]; here the edges of the graph are drawn as polygonal chains composed of axis parallel segments. This style of drawing has applications in three dimensional VLSI circuit design (see for example [1,34] The three dimensional orthogonal grM consists of grid points in three dimensional space with ....

....expense of allowing seven bend edges, this algorithm produces more orientationindependent drawings than the DYNA4IC STAIRCASE algorithm. That every 6 graph has a 3 Bend drawing was established by the 3 BENDS algorithm of Eades et al. 21,22] and the INCREMENTAL algorithm of Papakostas and Tollis [31]. The INCREMENTAL algorithm, 2 which supports the on line insertion of vertices in constant time, produces drawings with 4.63n 3 volume. The 3 BENDS algorithm produces general position drawings with 27n 3 volume; by deleting grid planes not containing a vertex or a bend the volume is reduced to ....

[Article contains additional citation context not shown here]

A. Papakostas, I.G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions, J. Graph Algorithms Appl. 3 (4) (1999) 81-115.

....v (respectively, I v ) port at a vertex v is said to be extremal if v has maximum (minimum) I coordinate taken over all vertices. Clearly, 3 D orthogonal drawings can only exist for graphs with maximum degree at most six. 3 D orthogonal drawings of maximum degree six graphs have been studied in [3, 4, 6, 10 13, 17, 19, 21, 22, 33, 35 37]. By representing a vertex by a grid box, 3 D orthogonal drawings of arbitrary degree graphs have also been considered; see for example [5, 8, 21] 3 D graph drawing has applications in VLSI circuit design [1, 2, 18, 23, 26] and software engineering [15, 16, 24, 25] for example. Note that there is ....

....for graphs with maximum degree at most six. 3 D orthogonal drawings of maximum degree six graphs have been studied in [3, 4, 6, 10 13, 17, 19, 21, 22, 33, 35 37] By representing a vertex by a grid box, 3 D orthogonal drawings of arbitrary degree graphs have also been considered; see for example [5, 8, 21]. 3 D graph drawing has applications in VLSI circuit design [1, 2, 18, 23, 26] and software engineering [15, 16, 24, 25] for example. Note that there is some experimental evidence suggesting that displaying a graph in three dimensions is better than in two [28, 29] Drawings with many bends ....

[Article contains additional citation context not shown here]

A. PAPAKOSTAS AND I. G. TOLLIS, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-- 115, 1999.

....we de ne the aspect ratio of a vertex v to be maxfX(v) Y (v)g = minfX(v) Y (v)g. We say that a drawing has bounded aspect ratios if there exists a constant r such that all vertices have aspect ratio at most r. 1. 1 Box Drawings Algorithms to produce orthogonal box drawings have been studied in [1, 4, 7, 8, 14, 19, 28, 29]. Lower bounds for the volume of orthogonal box drawings have been presented in [1, 7, 8, 14] Table 1 summarises the known bounds on the volume and maximum number of bends per edge with various aesthetic criteria. We include the number of layers in each construction as well. Table 1. Bounds on ....

....some 2 o(n=k ) Typically, is a small constant, so the assumption 2 o(n=k ) is reasonable. No drawing with a constant number of layers can be both degree restricted and have bounded aspect ratios. 1. 2 Point Drawings Algorithms for producing point drawings have been presented in [3, 9 11,13, 15, 17,19, 26, 25, 27]. A lower bound of ) for the volume of point drawings was established by Kolmogorov and Barzdin [15] Lower bounds for the number of bends in point drawings were established by Wood [30] Table 2. Upper Bounds for 3 Dimensional Orthogonal Point Drawing Graphs Max. Avg. Bends Bounding Box ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

....terms vertex and edge also refer to their representation in a drawing. At a vertex v, the six directions the edges incident with v can use are called ports. Clearly, orthogonal drawings can only exist for graphs with maximum degree six. 3 D orthogonal graph drawings have been studied in [1 5, 7, 9, 10, 13, 14]. By representing a vertex by a grid box, 3 D orthogonal drawings of arbitrary degree graphs have also been considered (see [14] The bounding box of a given drawing is the minimum axis parallel box which encloses the drawing. The following aesthetic criteria are the most commonly proposed ....

....by the DLM algorithm have at most four bends per edge and an average of at most 1 3 bends per edge. For graphs with maximum degree at most ve the DLM algorithm produces drawings with two bends per edge. Ad Hoc Algorithms: We have implemented the Incremental algorithm of Papakostas and Tollis [9] and the Reduce Forks algorithm of Di Battista et al. 3] The Incremental algorithm, which supports the on line insertion of vertices, produces drawings with O(n ) volume and at most three bends per edge. No bounds on the volume or the number of bends have been established for the Reduce Forks ....

A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

....graph drawing. Proposed models for 3 dimensional graph drawing include straight line drawings [14, 24, 32] convex drawings [12, 20] spline curve drawings [25] multilevel drawings of clustered graphs [19] visibility representations [2, 10] and of interest in this paper orthogonal drawings [4, 8, 13, 17, 21 23, 27, 29, 34, 36, 41 43]; here the edges of the graph are drawn as polygonal chains composed of axis parallel segments. This style of drawing has applications in 3 dimensional VLSI circuit design (see for example [1, 37] The 3 dimensional orthogonal grid consists of grid points in 3 dimensional space with integer ....

....23] no al. Dynamic Spiral no al. Dynamic no al. no al. BJSW Algorithm no al. 6] no al. n) O(n) O(n) 5=2 no al. no al. Diag. Layout Move. 4 2 7 Theorem 10 8n al. 23] Incremental Papakostas and Tollis [34] Modified o Wood [41, 43] Diag. Layout Move. Theorem 10 The Dynamic Staircase algorithm in [13] also using a 2 dimensional diagonal vertex layout, routes each edge vw with at most six bends using arbitrary unused ports at v and w. It follows that this algorithm is ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

....Compact algorithm of Eades et al. 11] which routes each edge with at most 7 bends, uses the least number of bends out of these algorithms. Other algorithms for 3 D orthogonal graph drawing have been proposed by Closson et al. 7] Eades et al. 11] Di Battista et al. 9] Papakostas and Tollis [22], and Wood [27, 28] Wood [29] establishes lower bounds for the number of bends, and Lynn et al. 18] introduce a number of postprocessing techniques for the re nement of drawings. That every 6 graph has a 3 bend drawing was established by the 3 Bends algorithm of Eades et al. 11] and the ....

....lower bounds for the number of bends, and Lynn et al. 18] introduce a number of postprocessing techniques for the re nement of drawings. That every 6 graph has a 3 bend drawing was established by the 3 Bends algorithm of Eades et al. 11] and the Incremental algorithm of Papakostas and Tollis [22]. The Incremental algorithm , which supports the on line insertion of vertices in constant time, produces drawings with 4:63n volume. The 3 Bends algorithm produces drawings with 27n volume by positioning each vertex v i at (3i; 3i; 3i) for some arbitrary ordering (v 1 ; v 2 ; ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions, J. Graph Algorithms Appl., 3(1999), 81-115.

....graph drawing. Proposed models for 3 dimensional graph drawing include straightline drawings [13, 23, 30] convex drawings [11, 19] spline curve drawings [24] multilevel drawings of clustered graphs [18] visibility representations [2, 8] and of interest in this paper orthogonal drawings [3, 5, 12, 16, 20 22, 26, 28, 32, 33, 39 41]; here the edges of the graph are drawn as polygonal chains composed of axis parallel segments. This style of drawing has applications in 3 dimensional VLSI circuit design (see for example [1, 34] The 3 dimensional orthogonal grid consists of grid points in 3 dimensional space with integer ....

.... [22] Compact3 multigraph 4 O(n) O(n) O(n) O n 3 no Eades et al. 22] Dlm simple 4 2 2 7 O(n) O(n) O(n) 2:13n 3 yes Theorem 2 3 Bends multigraph 3 O(n) O(n) O(n) 8n 3 yes Eades et al. 21, 22] Incremental multigraph 3 O(n) O(n) O(n) 4:63n 3 no Papakostas and Tollis [32] Modified 3 Bends multigraph 3 O(n) O(n) O(n) n 3 o n 3 yes Wood [39, 40] Dlm simple 5 2 O(n) O(n) O(n) n 3 yes Theorem 2 4 An early result due to Kolmogorov and Barzdin [26] established a lower bound of n 3=2 ) on the volume of a drawing (also see [5, 34] This lower ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

....algorithm of Eades et al. 11] which routes each edge with at most 7 bends, uses the least number of bends out 4 of these algorithms. Other algorithms for 3 D orthogonal graph drawing have been proposed by Closson et al. 7] Eades et al. 11] Di Battista et al. 9] Papakostas and Tollis [22], and Wood [27, 28] Wood [29] establishes lower bounds for the number of bends, and Lynn et al. 18] introduce a number of postprocessing techniques for the re nement of drawings. That every 6 graph has a 3 bend drawing was established by the 3 Bends algorithm of Eades et al. 11] and the ....

....lower bounds for the number of bends, and Lynn et al. 18] introduce a number of postprocessing techniques for the re nement of drawings. That every 6 graph has a 3 bend drawing was established by the 3 Bends algorithm of Eades et al. 11] and the Incremental algorithm of Papakostas and Tollis [22]. The Incremental algorithm 1 , which supports the on line insertion of vertices in constant time, produces drawings with 4:63n 3 volume. The 3 Bends algorithm produces drawings with 27n 3 volume 2 by positioning each vertex v i at (3i; 3i; 3i) for some arbitrary ordering (v 1 ; v 2 ; ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions, J. Graph Algorithms Appl., 3(1999), 81-115.

....I (respectively, I Gamma ) port at a vertex v is said to be extremal if v has maximum (minimum) I coordinate taken over all vertices. Clearly, orthogonal drawings can only exist for graphs with maximum degree six. 3 D orthogonal drawings of maximum degree six graphs have been studied in [7, 9 11, 15, 18, 19, 28]. By representing a vertex by a grid box, 3 D orthogonal drawings of arbitrary degree graphs have also been considered [4 6, 12, 18, 29, 30] 3 D graph visualisation has applications in VLSI circuit design [1, 2, 17, 20, 23] and software engineering [13, 14, 21, 22] for example. Drawings with ....

....Clearly, orthogonal drawings can only exist for graphs with maximum degree six. 3 D orthogonal drawings of maximum degree six graphs have been studied in [7, 9 11, 15, 18, 19, 28] By representing a vertex by a grid box, 3 D orthogonal drawings of arbitrary degree graphs have also been considered [4 6, 12, 18, 29, 30]. 3 D graph visualisation has applications in VLSI circuit design [1, 2, 17, 20, 23] and software engineering [13, 14, 21, 22] for example. Drawings with many bends appear cluttered and are difficult to visualise. In VLSI layouts bends in the wires increase the cost of production and the chance ....

[Article contains additional citation context not shown here]

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81--115, 1999.

No context found.

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

No context found.

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

No context found.

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

No context found.

A. Papakostas and I. G. Tollis. Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81--115, 1999.

No context found.

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81--115, 1999.

No context found.

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81{ 115, 1999.

No context found.

A. Papakostas and I. G. Tollis, Algorithms for incremental orthogonal graph drawing in three dimensions. J. Graph Algorithms Appl., 3(4):81-115, 1999.

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