Automating the Layout of Network Diagrams with Specified Visual Organization

IEEE Transactions on Systems, Man and Cybernetics

Volumn 24, Issue 3, 1994, Pages 440-454

  Kosak, Corey ^a   Marks, Joe ^b   Shieber, Stuart ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; COMPUTER GRAPHICS; COMPUTER VISION; CONSTRAINT THEORY; ELECTRIC NETWORK TOPOLOGY; GRAPHIC METHODS; HEURISTIC PROGRAMMING; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; TESTING;

AESTHETIC OPTIMALITY; LAYOUT AESTHETICS; NETWORK DIAGRAMS; PERCEPTUAL ORGANIZATION; SPECIFIED VISUAL ORGANIZATION; SYNTACTIC VALIDITY; VISUAL ORGANIZATION;

SCHEMATIC DIAGRAMS;

EID: 0028388569     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.278993     Document Type: Article

References (30)

1. J. Bertin, Semiology of Graphics: Diagrams, Networks, Maps (translated by W. J. Berg). Madison, WI: Univ. Wisconsin, 1983.
2. K.-F. Böhringer and F. N. Paulisch, “Using constraints to achieve stability in automatic graph layout algorithms,” in CHI ‘90 Conf. Proc., pp. 43–51, Seattle, WA, 1990.
3. L. Davis, Handbook of Genetic Algorithms. New York: Van Nostrand Reinhold, 1991.
4. E. Dengler, M. Friedell, and J. Marks, “Constraint-driven diagram layout,” in Proc. 1993 IEEE Symp. on Visual Languages, pp. 330–335, Bergen, Norway, 1993.
5. P. Eades and R. Tamassia, “Algorithms for drawing graphs: An annotated bibliography,” Tech. Rep. CS-89-09, revised version, Dept. Computer Science, Brown Univ., 1989.
6. M. R. Garey and D. S. Johnson, “Crossing number is NP-complete,” SIAM J. Algebraic and Discrete Methods, vol. 4, no. 3, pp. 312–316, Sept. 1983.
7. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA, Addison-Wesley, 1988.
8. W. D. Hillis, The Connection Machine. Cambridge, MA: MIT Press, 1985.
9. T. Kamada and S. Kawai, “A general framework for visualising abstract objects and relations,” ACM Trans. Graphics, vol. 10, no. 1, pp. 1–39, Jan. 1991.
10. L. Kaufman, Sight and Mind: An Introduction to Visual Perception. New York: Oxford Univ. Press, 1974.
11. S. Kochhar, M. Friedell, S. Sistare, J. Juda, M. La Polla, J. Marks, P. McMurry, C. Kosak, and S. Shieber, “A design environment for scientific and program visualizations,” in Proc. Compugraphics ‘91, pp. 321–332, Sesimbra, Portugal, Sept. 1991.
12. W. Köhler, Gestalt Psychology. New York: New American Library, 1947.
13. R. Kopeikin, “ISDN professional service,” Electrical Communication, vol. 63, no. 4, pp. 366–373, 1989.
14. C. Kosak, J. Marks, and S. Shieber, “A parallel genetic algorithm for network-diagram layout,” in Proc. Fourth Int. Conf. on Genetic Algorithms, pp. 458–465, Univ. California, San Diego, CA, July 1991.
15. S. M. Kosslyn, “Graphics and human information processing,” J. Amer. Stat. Assoc., vol. 80, no. 391, pp. 499–512, 1985.
16. S. M. Kosslyn, “Understanding charts and graphs,” Applied Cognitive Psychology, vol. 3: 185–226, 1989.
17. J. Marks, Automating the Design of Network Diagrams, Ph.D. dissertation, Div. Applied Sciences, Harvard Univ., 1991.
18. J. Marks, “The competence of an automated graphic designer,” in Proc. 1991 Long Island Conf. on Artificial Intelligence and Computer Graphics, pp. 53–61, New York Institute of Technology, Mar. 1991.
19. J. Marks, “A formal specification scheme for network diagrams that facilitates automated design,” J. Visual Language and Computing, vol. 2, no. 4, pp. 395–414, Dec. 1991.
20. J. Marks and E. Reiter, “Avoiding unwanted conversational implicatures in text and graphics,” in Proc. Eighth National Conf. on Artificial Intelligence (AAAI ‘90), pp. 450–456, Boston MA, 1990.
21. A. Markus, “Experiments with genetic algorithms for displaying graphs,” in Proc. 1991 IEEE Workshop on Visual Languages, pp. 62–67, Kobe, Japan, Oct. 1991.
22. J. Martin and C. McClure, Diagramming Techniques for Analysts and Programmers. Englewood Cliffs, NJ: Prentice-Hall, 1985.
23. T. Masui, “Graphic object layout with interactive genetic algorithms,” in Proc. 1992 Workshop on Visual Languages, pp. 74–80, Seattle, WA, Sept. 1992.
24. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Berlin: Springer-Verlag, 1992.
25. R. A. O’Keefe, The Craft of Prolog. Cambridge, MA: MIT Press, 1990.
26. B. S anden, “An entity-life modeling approach to the design of concurrent software,” Comm. ACM, vol. 32, no. 3, p. 336, 1989.
27. M. Smith, P. Briggs, and E. H. Freeman, “Understanding causal feed-back using the strategic planning system (SPS),” in Proc. Seventh Conf. on AI Applications, Miami Beach, FL, Feb. 1991.
28. L. Sterling and E. Shapiro, The Art of Prolog: Advanced Programming Techniques. Cambridge, MA: MIT Press, 1986.
29. K. Sugihara, K. Yamamoto, K. Takada, and M. Inaba, “Layout-by-example: Example: A fuzzy visual language for specifying stereotypes of diagram layout,” in Proc. 1992 IEEE Workshop on Visual Languages, pp. 88–94, Seattle, WA, Sept. 1992.
30. R. Tamassia, G. D. Battista, and C. Batini, “Automatic graph drawing and readability of diagrams,” IEEE Trans. Syst., Man, Cybern., vol. 18, no. 1, pp. 61–79, 1988.