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
Publisher: Knowledge Systems Institute
Languages: English
Types: Unknown
Subjects: QA76, QA75
In search-based graph drawing methods there are\ud typically a number of parameters that control the search algorithm.\ud These parameters do not affect the fitness function, but\ud nevertheless have an impact on the final layout. One such search\ud method is hill climbing, and, in the context of schematic layout, we\ud explore how varying three parameters (grid spacing, the starting\ud distance of allowed node movement and the number of iterations)\ud affects the resultant diagram. Although we cannot characterize\ud schematics completely and so cannot yet automatically assign\ud parameters for diagrams, we observe that when parameters are\ud set to values that increase the search space, they also tend to\ud improve the final layout. We come to the conclusion that hillclimbing\ud methods for schematic layout are more prone to reaching\ud local optima than had previously been expected and that a wider\ud search, as described in this paper, can mitigate this, so resulting\ud in a better layout.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Daniel Chivers and Peter Rodgers. Gesture-based input for drawing schematics on a mobile device. In Proceedings of Information Visualization, pages 127-134, 2011.
    • Ron Davidson and David Harel. Drawing graphs nicely using simulated annealing. ACM Trans. Graph., 15(4):301-331, October 1996.
    • Seok-Hee Hong, Damian Merrick, and Hugo A. D. do Nascimento. The metro map layout problem. In Proceedings of the 2004 Australasian symposium on Information Visualisation - Volume 35, APVis '04, pages 91-100, Darlinghurst, Australia, 2004. Australian Computer Society, Inc.
    • Martin N o¨llenburg and Alexander Wolff. A mixed-integer program for drawing high-quality metro maps. In Proceedings of the 13th international conference on Graph Drawing, GD'05, pages 321-333, Berlin, Heidelberg, 2006. Springer-Verlag.
    • Annals of Operations Research, 63(5):511-623, October 1996.
    • Jonathan Stott, Peter Rodgers, Juan Carlos Mart´ınez-Ovando, and Stephen G. Walker. Automatic metro map layout using multicriteria optimization. IEEE Transactions on Visualization and Computer Graphics, 17(1):101-114, 2011.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article