메뉴 건너뛰기




Volumn 2912, Issue , 2004, Pages 450-459

Axis-by-axis stress minimization

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); OPTIMIZATION;

EID: 35048817390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24595-7_42     Document Type: Article
Times cited : (9)

References (12)
  • 1
    • 84867457323 scopus 로고    scopus 로고
    • Drawing Directed Graphs Using One-Dimensional Optimization
    • LNCS 2528, Springer-Verlag
    • L. Carmel, D. Harel and Y. Koren, "Drawing Directed Graphs Using One-Dimensional Optimization", Proc. Graph Drawing 2002, LNCS 2528, pp. 193-206, Springer-Verlag, 2002.
    • (2002) Proc. Graph Drawing 2002 , pp. 193-206
    • Carmel, L.1    Harel, D.2    Koren, Y.3
  • 3
    • 0009428249 scopus 로고    scopus 로고
    • Drawing Graphs to Convey Proximity: An Incremental Arrangement Method
    • J. D. Cohen, "Drawing Graphs to Convey Proximity: an Incremental Arrangement Method", ACM Transactions on Computer-Human Interaction 4 (1997), 197-229 .
    • (1997) ACM Transactions on Computer-Human Interaction , vol.4 , pp. 197-229
    • Cohen, J.D.1
  • 4
    • 84958536778 scopus 로고    scopus 로고
    • A Multi-dimensional Approach to ForceDirected Layouts of Large Graphs
    • LNCS 1984, Springer-Verlag
    • P. Gajer, M. T. Goodrich and S. G. Kobourov, "A Multi-dimensional Approach to ForceDirected Layouts of Large Graphs", Proc. Graph Drawing 2000, LNCS 1984, pp. 211-221, Springer-Verlag, 2000.
    • (2000) Proc. Graph Drawing 2000 , pp. 211-221
    • Gajer, P.1    Goodrich, M.T.2    Kobourov, S.G.3
  • 5
    • 4043165234 scopus 로고    scopus 로고
    • A Multi-Scale Method for Drawing Graphs Nicely
    • R. Hadany and D. Harel, "A Multi-Scale Method for Drawing Graphs Nicely", Discrete Applied Mathematics 113 (2001), 3-21.
    • (2001) Discrete Applied Mathematics , vol.113 , pp. 3-21
    • Hadany, R.1    Harel, D.2
  • 7
    • 84867475630 scopus 로고    scopus 로고
    • Graph Drawing by High-Dimensional Embedding
    • LNCS 2528, Springer-Verlag
    • D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding", Proc. Graph Drawing 2002, LNCS 2528, pp. 207-219, Springer-Verlag, 2002.
    • (2002) Proc. Graph Drawing 2002 , pp. 207-219
    • Harel, D.1    Koren, Y.2
  • 9
    • 35048835916 scopus 로고    scopus 로고
    • One-Dimensional Graph Drawing: Part i -Drawing Graphs by Axis Separation
    • Faculty of Math, and Computer Science, The Weizmann Institute of Science
    • Y. Koren and D. Harel, "One-Dimensional Graph Drawing: Part I -Drawing Graphs by Axis Separation", Technical report MCS03-08, Faculty of Math, and Computer Science, The Weizmann Institute of Science, 2003.
    • (2003) Technical Report MCS03-08
    • Koren, Y.1    Harel, D.2
  • 11
    • 0024640140 scopus 로고
    • An Algorithm for Drawing General Undirected Graphs
    • T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs", Information Processing Letters 31 (1989), 7-15.
    • (1989) Information Processing Letters , vol.31 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 12
    • 84887006810 scopus 로고
    • A Nonlinear Mapping for Data Structure Analysis
    • J. W. Sammon, "A Nonlinear Mapping for Data Structure Analysis", IEEE Trans, on Computers 18 (1969), 401-409.
    • (1969) IEEE Trans, on Computers , vol.18 , pp. 401-409
    • Sammon, J.W.1


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