Logo

Login

Generating Customized Layouts

Wang, Xiaobo and Miyamoto, Isao (1996) Generating Customized Layouts. [Conference Paper]

Full text not available from this repository.

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-and-conquer 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.

Item Type:Conference Paper
Classifications:M Methods > M.400 Force-directed / Energy-based
ID Code:232
Deposited By:Maciejak, Agnes
Deposited On:20 Oct 2004
Last Modified:18 Sep 2008 13:08

Repository Staff Only: item control page

References

1. G. Di 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.

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.

3. E. Dengler, M. Friedell and J. Marks, "Constraint-driven diagram layout," Proc. of Visual Language 93, 1993.

4. P. Eades, "A heuristic for graph drawing," Congress Numeratium, Vol. 42, 1984.

5. A. Frick, A. Ludwing, and H. Mehldau, "A fast adaptive layout algorithm for undirected graphs," Graph Drawing 94, Princeton, New Jersey, October, 1994.

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.

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.

8. T. Kamada and S. Kawai, "An algorithm for drawing general undirected graphs," Information Processing Letters, Vol. 31, 1989.

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.

10. T. Lin and P. Eades, "Integration of declarative and algorithmic approaches for layout creation," Graph Drawing 94, Princeton, New Jersey, October, 1994.

11. S. C. North, "Drawing ranked digraphs with recursive clusters," Proc. of ALCOM Int'l Workshop on Graph Drawing, Paris, France, Sept. 1993.

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.

13. K. Sugiyama and K. Misue, "A simple and unified method for drawing graphs: magnetic-spring algorithm," Graph Drawing 94, Princeton, New Jersey, October, 1994.

14. D. Tunkelang, "An aesthetic layout algorithm for undirected graphs," Thesis for Master Degree, Computer Science and Engineering Department, M.I.T., 1992.

15. X. Wang, "Generating Customized Layouts Automatically," PhD thesis, Univ. of Hawaii at Manoa, August, 1995.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.