메뉴 건너뛰기




Volumn 26, Issue 12, 1996, Pages 1415-1438

Aesthetics-based graph layout for human consumption

Author keywords

Aesthetics; Force directed placement; Graph layout; Multiobjective optimization

Indexed keywords

ALGORITHMS; GRAPHIC METHODS; SIMULATED ANNEALING; TREES (MATHEMATICS); USER INTERFACES;

EID: 0030401382     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-024x(199612)26:12<1415::aid-spe69>3.0.co;2-p     Document Type: Article
Times cited : (81)

References (29)
  • 7
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • Peter Eades, 'A heuristic for graph drawing', Congressus Numerantium, 42, 149-160 (1984).
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 9
    • 0003659990 scopus 로고
    • Drawing graphs nicely using simulated annealing
    • Technical Report CS89-13, Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, July To appear
    • R. Davidson and D. Harel, 'Drawing graphs nicely using simulated annealing', Technical Report CS89-13, Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, July 1989. To appear, CACM.
    • (1989) CACM
    • Davidson, R.1    Harel, D.2
  • 11
    • 0029409451 scopus 로고
    • An approach to automatic display layout using combinatorial optimization algorithms
    • P. Luders, R. Ernst, and S. Stille, 'An approach to automatic display layout using combinatorial optimization algorithms',Software-Practice and Experience, 25(11), 1183-1202 (1995).
    • (1995) Software-Practice and Experience , vol.25 , Issue.11 , pp. 1183-1202
    • Luders, P.1    Ernst, R.2    Stille, S.3
  • 15
  • 18
    • 0347794523 scopus 로고
    • Technical Report 8818, Department of Electrical Engineering, Yale University
    • J. Lam, 'An efficient simulated annealing schedule', Technical Report 8818, Department of Electrical Engineering, Yale University, 1988.
    • (1988) An Efficient Simulated Annealing Schedule
    • Lam, J.1
  • 19
    • 0018480537 scopus 로고
    • A forced directed component placement procedure for printed circuit boards
    • Neil R. Quinn, Jr. and Melvin A. Breuer, 'A forced directed component placement procedure for printed circuit boards', IEEE Trans. on Circuits and Systems, CAS-26(6), 377-388 (1979).
    • (1979) IEEE Trans. on Circuits and Systems , vol.CAS-26 , Issue.6 , pp. 377-388
    • Quinn Jr., N.R.1    Breuer, M.A.2
  • 20
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • Tomihisa Kamada and Satoru Kawai, 'An algorithm for drawing general undirected graphs', Information Processing Letters, 31, 7-15 (1989).
    • (1989) Information Processing Letters , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 21
    • 0003834557 scopus 로고
    • W. H. Freeman
    • D. Marr, Vision, W. H. Freeman, 1982.
    • (1982) Vision
    • Marr, D.1
  • 22
    • 0022700207 scopus 로고
    • Automating the design of graphical presentations of relational information
    • Jock Mackinlay, 'Automating the design of graphical presentations of relational information', ACM Transactions on Graphics, 5(2), 110-141 (1986).
    • (1986) ACM Transactions on Graphics , vol.5 , Issue.2 , pp. 110-141
    • Mackinlay, J.1
  • 23
    • 5644249812 scopus 로고
    • Nice drawings of graphs are computationally hard
    • P. Gorny and M. J. Tauber (eds), Springer, May
    • Franz J. Brandenburg, 'Nice drawings of graphs are computationally hard', in P. Gorny and M. J. Tauber (eds), Visualization in Human-Computer Interaction, Springer, May 1988, pp. 1-15.
    • (1988) Visualization in Human-Computer Interaction , pp. 1-15
    • Brandenburg, F.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.