D. I. Ostry, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....have positive volume. We are interested in polyline drawings with small volume. The volume of straight line drawings has been widely studied [21, 26, 31, 37, 41, 42, 51, 103, 107, 125] Three dimensional graph drawings in which the vertices are allowed real coordinates have also been studied [23, 28, 29, 34, 43, 59, 78 81, 93, 102]. Aesthetic criteria besides volume that have been considered include symmetry [78 81] aspect ratio [29, 59] angular resolution [29, 59] edge separation [29, 59] and convexity [28, 29, 43] Table 2 summarises the best known upper bounds on the volume of polyline drawings, including those ....

D. I. OSTRY, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

....so that 2D drawings have positive volume. We are interested in 3D drawings with small volume. The volume of 3D drawings has been widely studied [3, 6, 9, 11, 14, 16, 19, 36 38, 40] Three dimensional graph drawings in which the vertices are allowed real coordinates have also been studied [5, 7, 8, 10, 17, 21, 26 29, 32, 35]. Aesthetic criteria besides volume which have been considered include symmetry [26 29] aspect # Research supported by NSERC and FCAR. Completed at the Departament de Matem atica Aplicada II, Universitat Polit ecnica de Catalunya, Barcelona, Spain. ratio [8, 21] angular resolution [8, 21] ....

D. I. OSTRY, Some Three-Dimensional Graph Drawing Algorithms . Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

....initial layout of graphs for one of the systems described in Chapter 2 of this thesis. Other work of interest includes the GEM and GEM 3D systems [Frick et al. 1994, Bru# and Frick, 1996] examples of successful implementations of a force directed approach, in both two and three dimensions. Ostry [Ostry, 1996] thoroughly reviews some 3D graph drawing algorithms, including spring based approaches and 3D layered methods. An alternative to force directed approaches for three dimensional graph layout is 3D orthogonal graph drawing [Patrignani and Vargiu, 1997, Eades et al. 1997] where 12 each ....

Ostry, D. I. (1996). Some three-dimensional graph drawing algorithms. Master's thesis. Department of Computer Science and Software Engineering, The University of Newcastle.

.... drawings with the vertices having real coordinates have been studied by Bru and Frick [4] Chilakamarri et al. 6] Chrobak et al. 7] Cruz and Twarog [9] Eades and Garvan [15] Garg et al. 18] Hong [22] Hong and Eades [23, 24] Hong et al. 25] Monien et al. 27] and Ostry [29]. Aesthetic criteria besides volume which have been considered include symmetry [22 25] aspect ratio [7, 18] angular resolution [7, 18] edge separation [7, 18] and convexity [6, 7, 15] Tree Decompositions: Before stating our results we recall some definitions. A tree decomposition of a ....

D. I. OSTRY, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

.... drawings with the vertices having real coordinates have been studied by Bru and Frick [4] Chilakamarri et al. 6] Chrobak et al. 7] Cruz and Twarog [9] Eades and Garvan [13] Garg et al. 16] Hong [19] Hong and Eades [20, 21] Hong et al. 22] Monien et al. 24] and Ostry [26]. Aesthetic criteria besides volume which have been considered include symmetry [19 22] aspect ratio [7, 16] angular resolution [7, 16] edgeseparation [7, 16] and convexity [6, 7, 13] Tree Decompositions: Before stating our results we recall some definitions. A tree decomposition of a graph ....

D. I. OSTRY, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

.... example the algorithms of Cohen, Eades, Lin, and Ruskey [5] Drawing general graphs in 3D using the force directed approach is studied by Fruchterman and Reingold [19] and Monien, Ramme, and Salmen [31] Other recent 3D drawing algorithms include Bru and Frick [4] Cruz and Twarog [7] and Ostry [33]. In the context of orthogonal drawings, 3D point drawing algorithms were developed by Eades, Symvonis, and Whitesides [15] and Papakostas and Tollis [34] 3D orthogonal box drawings were studied by Biedl [1] and multi dimensional orthogonal graph drawings are presented by Wood [40] 2.2 ....

D. I. Ostry. Some three-dimensional graph drawing algorithms. Master's thesis, Dept. Comput. Sci., Univ. of Newcastle, Newcastle, Australia, 1996.

.... example the algorithms of Cohen, Eades, Lin, and Ruskey [5] Drawing general graphs in 3D using the force directed approach is studied by Fruchterman and Reingold [19] and Monien, Ramme, and Salmen [31] Other recent 3D drawing algorithms include Bru and Frick [4] Cruz and Twarog [7] and Ostry [33]. In the context of orthogonal drawings, 3D point drawing algorithms were developed by Eades, Symvonis, and Whitesides [15] and Papakostas and Tollis [34] 3D orthogonal box drawings were studied by Biedl [1] and multi dimensional orthogonal graph drawings are presented by Wood [40] 2.2 ....

D. I. Ostry. Some three-dimensional graph drawing algorithms. Master's thesis, Dept. Comput. Sci., Univ. of Newcastle, Newcastle, Australia, 1996.

....It uses a physical analogy, where a graph is seen as a system of bodies with forces acting among them. These algorithms seek a configuration of the system with, possibly local, minimal energy. Force directed approaches have been exploited in 3D graph drawing to devise the algorithms presented in [4, 6, 9, 19, 26, 14, 20]. Further, the research on straight line drawings stimulated a deep investigation on theoretical bounds. Examples of bounds on the volume of a straight line drawing can be found in [5, 21] Namely, in [5] it is shown that a graph can be drawn in an n 2n 2n volume, which is asymptotically ....

D. I. Ostry. Some Three-Dimensional Graph Drawing Algorithms. M.Sc. thesis, Dept. Comput. Sci. and Soft. Eng., Univ. Newcastle, Oct. 1996.

No context found.

D. I. Ostry, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

No context found.

D. I. Ostry, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

No context found.

D. I. Ostry, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

No context found.

D. I. OSTRY, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

No context found.

D. I. Ostry, Some three-dimensional graph drawing algorithms, master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

No context found.

D. I. Ostry, Some Three-Dimensional Graph Drawing Algorithms. Master's thesis, Department of Computer Science and Software Engineering, The University of Newcastle, Australia, 1996.

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