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.
Chapter PDF
Similar content being viewed by others
Keywords
- Algorithmic Approach
- Diagrammatic Representation
- Algorithmic Method
- Graphical Object
- Preference Criterion
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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, Universita' di Room “La Sapienza”, September 1992.
G. Di Battista, R. Tamassia, and I.G. Tollis. Constrained visibility representations of graphs. Information Processing 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 CHI 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, Univ. 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 Science, 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 heuristic 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 — Practice and Experience, 20(S1):1/63–S1/88, 1990. also as Technical Report 8/88, Fakultat fur Informatik, Univ. of Karlsruhe, 1988.
Tom Sawyer Software. Graph layout toolkit. available from bmadden@TomSawyer.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 langauges for visualization. In Visualization 92, pages 202–209, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, T., Eades, P. (1995). Integration of declarative and algorithmic approaches for layout creation. In: Tamassia, R., Tollis, I.G. (eds) Graph Drawing. GD 1994. Lecture Notes in Computer Science, vol 894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58950-3_392
Download citation
DOI: https://doi.org/10.1007/3-540-58950-3_392
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58950-1
Online ISBN: 978-3-540-49155-2
eBook Packages: Springer Book Archive