See this document in CiteSeerX!

Some Three-Dimensional Graph Drawing Algorithms (1996)  (Make Corrections)  (14 citations)
Diethelm Ironi Ostry



  Home/Search   Context   Related

 
View or download:
newcastle.edu.au/pub/th...dostry96.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.mu.oz.au/~rwebber/...bib.shtml (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In order to realise the potential benefits of three--dimensional (3D) display of relational information, there is a need for effective 3D human--computer interface designs. Algorithms for automatically creating 3D visual representations of relational information are a significant component of these interfaces. One productive strategy for developing such algorithms has been via the graph as an intermediate representation of the relational information: the information is first expressed as a... (Update)

Cited by:   More
Three-Dimensional Orthogonal Graph Drawing - Wood (2000)   (Correct)
Stacks, Queues and Tracks: Layouts of Graph Subdivisions - Dujmovic, Wood (2004)   (Correct)
Layout of Graphs with Bounded Tree-Width - Dujmovic, Morin, Wood (2004)   (Correct)

Active bibliography (related documents):   More   All
1.6:   Algorithms for Drawing Clustered Graphs - Feng (1997)   (Correct)
0.5:   A Brief Survey of Issues Relating to the Reliability of Simulation .. - Hayes   (Correct)
0.5:   Straight-Line Drawing Algorithms for Hierarchical.. - Eades, Feng, Lin.. (1999)   (Correct)

Similar documents based on text:   More   All
0.2:   Pathwidth and Layered Drawings of Trees - Suderman (2002)   (Correct)
0.1:   The Effect of Attention in the Representation of Relational.. - Yarlas, Sloutsky   (Correct)
0.1:   Centre For Discrete Mathematics And Computing - In The Department   (Correct)

Related documents from co-citation:   More   All
16:   Graph Drawing: 7th International Symp (context) - Kratochvil, Proc - 1999
14:   graph drawing with simulated annealing (context) - Cruz, Twarog - 1996
14:   of Lecture Notes in Comput (context) - BRANDENBURG, Proc et al. - 1996

BibTeX entry:   (Update)

D. I. Ostry. Some Three-Dimensional Graph Drawing Algorithms. M.Sc. thesis, Dept. Comput. Sci. and Soft. Eng., Univ. Newcastle, Oct. 1996. http://citeseer.ist.psu.edu/ostry96some.html   More

@mastersthesis{ ostry96some,
    author = "Diethelm Ironi Ostry",
    title = "Some Three-Dimensional Graph Drawing Algorithms",
    year = "1996",
    url = "citeseer.ist.psu.edu/ostry96some.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1535   Cambridge University Press (context) - Press, Teukolsky et al. - 1992
773   Reducibility among combinatorial problems (context) - Karp - 1972
235   Classical Mechanics (context) - Goldstein - 1980
198   Algorithms for drawing graphs: An annotated bibliography (context) - Di Battista, Eades et al. - 1994
191   Solving Ordinary Differential Equations II (context) - Hairer, Wanner - 1991
185   Methods for visual understanding of hierarchical systems (context) - Sugiyama, Tagawa et al. - 1981
175   Cone trees: Animated 3d visualizations of hierarchical infor.. (context) - Robertson, Mackinlay et al. - 1991
145   A heuristic for graph drawing (context) - Eades - 1984
124   How to draw a graph (context) - Tutte - 1963
113   Crossing number is NP--complete (context) - Garey, Johnson - 1983
104   An algorithm for drawing general undirected graphs (context) - Kamada, Kawai - 1989
94   Numerical Initial Value Problems in Ordinary Differential Eq.. (context) - Gear - 1971
87   Drawing graphs nicely using simulated annealing - Davidson, Harel - 1989
86   Automatic graph drawing and readability of diagrams (context) - Tamassia, Di Battista et al. - 1988
79   Automated synthesis of data paths in digital systems (context) - Tseng - 1984
70   REDUCE User's manual (context) - Hearn - 1991
58   Dag -- a program that draws directed graphs - Gansner, North et al. - 1988
56   How to draw a directed graph (context) - Eades, Sugiyama - 1991
56   IEEE Transactions on Software Engineering (context) - Gansner, Koutsofios et al. - 1993
43   Dynamical Systems and Linear Algebra (context) - Hirsch, Smale - 1974
43   Mathematical Methods of Classical Mechanics (context) - Arnol'd - 1978
39   Designing the user interface: strategies for effective human.. (context) - Schneiderman - 1987
34   visualization of program information (context) - Reiss - 1995
32   The Inventor Mentor: Programming Object-oriented 3D Graphics.. (context) - Wernecke - 1994
31   graph drawing with simulated annealing (context) - Cruz, Twarog - 1996
29   The state of the art of visual languages for visualization (context) - Williams, Rasure et al. - 1992
27   a library of efficient data types and algorithms (context) - Naher, Melhorn - 1989
26   How to draw a planar clustered graph (context) - Feng, Cohen et al. - 1995
24   Numerical Solution of Ordinary Differential Equations (context) - Shampine - 1994
21   A parallel simulated annealing algorithm for generating 3D l.. - Monien, Ramme et al. - 1996
21   Graphed: An interactive graph editor (context) - Himsolt - 1989
21   Planarity for clustered graphs (context) - Feng, Cohen et al. - 1995
20   A parallel genetic algorithm for network-diagram layout (context) - Kosak, Marks - 1991
18   an edge crossing problem (context) - Eades, McKay et al. - 1986
18   An application of three dimensional visualization to object-.. (context) - Koike - 1992
17   Edge concentration: A method for clustering directed graphs (context) - Newbery - 1989
16   World Scientific Series in Computer Science (context) - Kamada, Objects - 1989
13   Theoretical Computer Science (context) - Ehrenfeucht, Rozenberg et al. - 1990
12   An overview of diagram based idea organizer: D-abductor (context) - Misue, Sugiyama - 1993
11   Direct Methods for N-Body Simulations (context) - Aarseth - 1985
10   Automatic selection of methods for solving stiff and nonstif.. (context) - Petzold - 1983
10   Computer drawn flowcharts (context) - Knuth - 1963
9   Integration of declarative and algorithmic approaches for la.. (context) - Lin, Eades - 1994
9   a platform for combinatorial and geometric computing (context) - Naher, Melhorn
8   Spring algorithms and symmetry - Lin, Eades
8   Numerical methods for unconstrained optimisation and nonline.. (context) - Dennis, Schnabel - 1983
8   Diagram server (context) - Di Battista, Liotta et al. - 1992
7   A graph theoretic approach to aesthetic layout of informatio.. (context) - Batini, Nardelli et al. - 1984
7   Automatic layout of PERT diagrams with XPERT (context) - Di Battista, Pietrosanti et al. - 1989
7   A cognitive approach for graph drawing (context) - Sugiyama - 1987
6   The ISI grapher: A portable tool for displaying graphs picto.. (context) - Robins - 1987
6   Representations of graphs on a cylinder (context) - Tamassia, Tollis - 1991
6   Constraint--based spring--model algorithm for graph layout (context) - Kamps, Kleinz - 1996
5   Integration of stiff equations (context) - Curtiss, Hirschfelder - 1952
4   part II: Representation through labeled tree families (context) - Ehrenfeucht, Rozenberg et al. - 1990
3   Building Interactive Diagram Applications (context) - Lai - 1993
3   An automatic layout facility and its applications (context) - Batini, Brunetti et al. - 1986
3   An automatic layout facility and its applications (context) - Batini, Brunetti et al. - 1986
2   Optimal order and time-step criterion for Aarseth-type N-bod.. (context) - Makino - 1991
2   Animated three-dimensional information visualisation (context) - Cohen, Fogarty et al. - 1996
2   Algorithms and software for ordinary differential equations .. (context) - Hindmarsh, Petzold - 1995
2   Algorithms and software for ordinary differential equations .. (context) - Hindmarsh, Petzold - 1995
2   COMAIDE: information visualisation using cooperative 3D prog.. (context) - Dodson - 1996
2   A new approach for drawing a hierarchical graph (context) - Eades, Lin et al. - 1990
1   General techniques for graph drawing (context) - Eades, Mutzel
1   Springer Lecture Notes in Computer Science series (context) - example, Graph
1   Information available from www (context) - Software, toolkit
1   Numerical Methods for Initial Value Problems in Ordinary Dif.. (context) - Fatunla - 1988
1   Algorithms for directed graphs (context) - Mangano - 1994
1   Upward drawings on planes and spheres (context) - Hashemi, Kisielewicz et al. - 1996
1   Grid intersection and box intersection graphs on surfaces (context) - Kratochvil, Przytycka - 1996
1   Department of Computer Science and Software Engineering (context) - Garvan, Eades et al. - 1996
1   IEEE Computer Graphics and Applications (context) - Baraff, of - 1995
1   a systematised collection of ODE solvers (context) - Hindmarsh - 1983
1   Scientific Visualisation (context) - Rosenblum - 1994
1   Heuristics for Planarization by Vertex Splitting (context) - Mendonca - 1992
1   Fast interactive 3-D graph visualisation (context) - Bruss, Frick - 1995
1   Directed graphs drawing by clanbased decomposition (context) - Shieh, McCreary - 1995
1   software in three dimensions (context) - Ware, Hui et al. - 1993
1   Visualising information nets in three dimensions (context) - Ware, Franck - 1994
1   Updating graph drawing aesthetics (context) - Purchase, Cohen et al. - 1996
1   The clique partitioning problem (context) - Bhasker, Samad - 1991



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.mu.oz.au/~rwebber/research/thesis/bib.shtml):   More
Bibliography - Aarts Korst   (Correct)
Finding the Best Viewpoints for Three-Dimensional Graph.. - Eades, Houle, Webber (1997)   (Correct)
Uniform Polyhedra - Maeder (1993)   (Correct)

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