Generating customized layouts

  • Xiaobo Wang
  • Isao Miyamoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)

Abstract

A good layout tool should be able to generate customized layouts according to different requirements given by the user or applications. To achieve this goal, existing layout techniques should be enhanced and integrated to take their advantages while compensating their disadvantages. This paper presents three layout techniques based on the force-directed placement approach, including a revised force-directed placement to draw graphs with vertices of nontrivial sizes, a divide-andconquer approach to generate structured layouts, and an integrated approach to support constraints. The combination of the three techniques significantly improves the layout ability of the force-directed placement. They can be used to generate customized layouts that reflect semantics, preference, or principles of perceptual psychology.

References

  1. 1.
    G. D. Battista, P. Eades, R. Tamassia and I. G. Tollis, “Algorithms for drawing graphs: An annotated bibliography,” Tech. Report, Computer Science Dept., Brown Univ., June, 1993.Google Scholar
  2. 2.
    R. Davidson and D. Harel, “Drawing graphs nicely using simulated annealing,” Technical Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989.Google Scholar
  3. 3.
    E. Dengler, M. Friedell and J. Marks, “Constraint-driven diagram layout,” Proc. of Visual Language 93, 1993.Google Scholar
  4. 4.
    P. Eades, “A heuristic for graph drawing,” Congress Numeratium, Vol. 42, 1984.Google Scholar
  5. 5.
    A. Frick, A. Ludwing, and H. Mehldau, “A fast adaptive layout algorithm for undirected graphs,” Graph Drawing 94, Princeton, New Jersey, October, 1994.Google Scholar
  6. 6.
    T. J. Fruchterman and E. M. Reingold, “Graph drawing by force-directed placement,” Software — Practice and Experience, Vol. 21, No. 11, Nov. 1991, pp. 1129–1164.Google Scholar
  7. 7.
    T. R. Henry, “Interactive graph layout: The exploration of large graphs,” Tech. Report 92-03, Computer Science Dept., Univ. of Arizona, Tucson, Arizona, 1992.Google Scholar
  8. 8.
    T. Kamada and S. Kawai, “An algorithm for drawing general undirected graphs,” Information Processing Letters, Vol. 31, 1989.Google Scholar
  9. 9.
    C. Kosak, J. Marks and S. Shieber, “Automating the layout of network diagrams with specified visual organization,” IEEE Trans. on Syst., Man, and Cyb., Vol. 24., No. 3, March 1994.Google Scholar
  10. 10.
    T. Lin and P. Eades, “Integration of declarative and algorithmic approaches for layout creation,” Graph Drawing 94, Princeton, New Jersey, October, 1994.Google Scholar
  11. 11.
    S. C. North, “Drawing ranked digraphs with recursive clusters,” Proc. of ALCOM Int'l Workshop on Graph Drawing, Paris, France, Sept. 1993.Google Scholar
  12. 12.
    K. Misue, P. Eades, W. Lai and K. Sugiyama, “Layout adjustment and the mental map,” Research Report ISIS-RR-94-6E, FUJITSU Lab. Ltd., Shizuoka, Japan, 1994.Google Scholar
  13. 13.
    K. Sugiyama and and K. Misue, “A simple and unified method for drawing graphs: magnetic-spring algorithm,” Graph Drawing 94, Princeton, New Jersey, October, 1994.Google Scholar
  14. 14.
    D. Tunkelang, “An aesthetic layout algorithm for undirected graphs,” Thesis for Master Degree, Computer Science and Engineering Department, M.I.T., 1992.Google Scholar
  15. 15.
    X. Wang, “Generating Customized Layouts Automatically,” PhD thesis, Univ. of Hawaii at Manoa, August, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Xiaobo Wang
    • 1
  • Isao Miyamoto
    • 1
  1. 1.Information and Computer Sciences DepartmentUniversity of HawaiiHonoluluUSA

Personalised recommendations