Integration of Declarative and Algorithmic Approaches for Layout Creation

Lin, Tao and Eades, Peter (1995) Integration of Declarative and Algorithmic Approaches for Layout Creation. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 376-387 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_392).

Full text not available from this repository.

Abstract

To be useful for a diagram-based interactive visualization system, a layout creation method should satisfy many requirements including user controllability, computational efficiency, flexibility and reusability. The layout created by the method should also be readable, and should conform to the semantics and syntax to the application. Unfortunately, the two traditional approaches (algorithmic and declarative) to layout creation are inadequate to meet these requirements. This paper illustrates a novel layout creation approach which integrates these two traditional approaches and satisfies the requirements mentioned above.

Item Type:Conference Paper
Additional Information:10.1007/3-540-58950-3_392
Classifications:D Aesthetics > D.001 General
ID Code:222

Repository Staff Only: item control page

References

G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: An annotated bibliography. To appear in Computational Geometry and Applications.

P. Bertolazzi, G. Di battista, and G. Liotta. Parametric graph drawing. Technical Report 6/67, Dipartmento di Informatica e Sistemistica, Università di Roma "La Sapienza", September 1992.

G. Di Battista, R. Tamassia, and I.G. Tollis. Constrained visibility representations of graphs. Information Proceeding Letters, 41:1-7, 1992.

K. Bohringer and F. Newbery Paulisch. Using constraints to acheive stability in automatic graph layout algorithms. In Proceedings of ACM 90, pages 43-51., 1990.

P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Technical Report 11.91, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", 1991.

I. Cruz. Expressing constraints for data display specification: a visual approach. Technical Report CS-93-57, Brown University, 1993.

R. Davidson and D. Harel. Drawing graphs nicely using simulated aneealing. Technical report, Department of Applied Mathematics and Computer Sciemce, The Weizmann Institute of Science, Rehovot, 1989.

E. Dengler, M. Friedell, and J. Marks. Constraint-driven diagram layout. In Visual Languages 93, 1993.

P. Eades. A heiristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.

P. Eades, T. Lin, and X. Lin. Two tree drawing conventions. International Journal of Computational Geometry and Applications, 3(2):133-153, 1993.

T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.

T. Lin. Diagram User Interfaces. PhD thesis, University of Newcastle. 1993.

M. Linton, J. Vlissides, and P. Calder. Composing user interfaces with interviews. Computer, 22(2):8-22, 1989.

F. Newbery Paulish and W.F. Tichy. Edge: An Extendible graph editor. Software Practices and Experience, 20(S1):1/63-S1/88, 1990. also as Technical Report 8/88, Fakultät für Informatik, Univ. of Karlsruhe, 1988.

Tom Sawyer Software. Graph layout toolkit. available from bmadden@Tom Sawyer.COM.

L. Stockmeyer. Optimal orientations of cells in slicing floorplan designs. Information and Control, 57:91-101, 1983.

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2):109-125, 1981.

C. Williams, J. Rasure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 92, pages 202, 1992.