LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Mutton, Paul; Rodgers, Peter (2002)
Publisher: IEEE
Languages: English
Types: Unknown
Subjects: QA76

Classified by OpenAIRE into

ACM Ref: MathematicsofComputing_DISCRETEMATHEMATICS
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Spring embedding is a widely used method for visualizing the connections in WWW maps, as it can typically produce a reasonable layout for most general graphs. However, the technique does not scale well and to improve the performance when dealing with large graphs various optimisations have been developed. Our preprocessor is a new optimization method that attempts to obtain a reasonably good initial drawing to be then used by the spring embedder. This initial drawing has edge lengths that are approximately equal along with a minimum node separation. This produces a layout that is closer to the final drawing than a random scattering of nodes and so allows fewer invocations of the spring embedder to produce an equally stable drawing.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1 I. Bru╬▓, A. Frick. Fast Interactive 3-D Graph Visualization. LNCS 1027. pp. 99-110. 1996.
    • 2 P. Eades. A Heuristic for Graph Drawing. Congressus Numerantium 42. pp. 149-60. 1984.
    • 3 A. Frick, A. Ludwig, H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. GD'94, LNCS 894. pp. 388-403. 1995.
    • 4 T. M. J. Fruchterman, E. M. Reingold. Graph Drawing by Force-directed Placement. Software - Practice and Experience Vol 21(11). pp. 1129-1164. 1991.
    • 5 D. Harel, Y. Koren. A Fast Multi-scale Method for Drawing Large Graphs. GD 2000, LNCS 1984. pp. 183- 196. 2001.
    • 6 M.L. Huang, P. Eades, R. F. Cohen. WebOFDAV - navigating and visualizing the Web on-line with animated context swapping. WWW7: 7th International World Wide Web Conference. 1998.
    • 7 D.S. McCrickard & C.M. Kehoe. Visualizing Search Results using SQWID. WWW6: 6th International World Wide Web Conference. 1997.
    • 8 T. Munzner and P. Burchard. Visualizing the Structure of the World Wide Web in 3D Hyperbolic Space. VRML '95, special issue of Computer Graphics, ACM SIGGRAPH, pp. 33-38. 1995.
    • 9 G. Parker, G. Franck, C. Ware. Visualization of Large Nested Graphs in 3D: Navigation and Interaction. J. Visual Languages and Computing, 9(3). pp. 299-317. 1998.
    • 10 A. Quigley. Large Scale Relational Information Visualization, Clustering and Abstraction. Thesis, University of Newcastle, Australia. 2001.
    • 11 A. Quigley, P. Eades. FADE: Graph Drawing, Clustering, and Visual Abstraction. GD 2000, LNCS 1984. pp. 197- 210. 2001.
    • 12 D. Tunkelang. JIGGLE: Java Interactive Graph Layout Algorithm. GD '98, LNCS 1547. pp. 413-422. 1998.
    • 13 C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. GD 2000, LNCS 1984. pp. 171-182. 2001.
    • 14 G.J. Wills. NicheWorks - Interactive Visualization of Very Large Graphs. J. Computational and Graphical Statistics 8,2 pp. 190-212. 1999.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article