메뉴 건너뛰기




Volumn , Issue , 2002, Pages 157-166

Drawing graphs with non-uniform vertices

Author keywords

force directed optimization; graph drawing; vertex overlaps; visualization

Indexed keywords

CURRENT FORCES; FORCE-DIRECTED; FORCE-DIRECTED METHOD; GEOMETRIC ELEMENTS; GRAPH DRAWING; OUTPUT QUALITY; REAL APPLICATIONS; VERTEX OVERLAPS;

EID: 0141943185     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1556262.1556288     Document Type: Conference Paper
Times cited : (46)

References (12)
  • 1
    • 0030264246 scopus 로고    scopus 로고
    • Drawing Graphs Nicely Using Simulated Annealing
    • R. Davidson and D. Harel, "Drawing Graphs Nicely Using Simulated Annealing", ACM Trans, on Graphics 15:4 (1996), 301-331. (Pubitemid 126418648)
    • (1996) ACM Transactions on Graphics , vol.15 , Issue.4 , pp. 301-331
    • Davidson, R.1    Harel, D.2
  • 2
    • 84957358492 scopus 로고    scopus 로고
    • Implementing a General-Purpose Edge Router
    • Proceedings of Graph Drawing 97
    • D. Dobkin, E. Gansner, E. Koutso£os and S. North, "Implementing a General-Purpose Edge Router", Proceedings of Graph Drawing 97, LNCS 1353, pp. 262-271.
    • LNCS , vol.1353 , pp. 262-271
    • Dobkin, D.1    Gansner, E.2    Koutsoos, E.3    North, S.4
  • 4
    • 0001070640 scopus 로고
    • A Heuristic for Graph Drawing
    • P. Eades, "A Heuristic for Graph Drawing", Congressus Numerantium 42 (1984), 149-160.
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 6
    • 84957872763 scopus 로고    scopus 로고
    • Improved Force-Directed Layouts
    • Proceedings of Graph Drawing 98
    • E. Gansner and S. North, "Improved Force-Directed Layouts", Proceedings of Graph Drawing 98, LNCS 1547, pp. 364-373.
    • LNCS , vol.1547 , pp. 364-373
    • Gansner, E.1    North, S.2
  • 7
    • 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 3-21 (2001).
    • (2001) Discrete Applied Mathematics , vol.113 , pp. 3-21
    • Hadany, R.1    Harel, D.2
  • 8
    • 84958552647 scopus 로고    scopus 로고
    • A Fast Multi-Scale Method for Drawing Large Graphs
    • Proceedings of Graph Drawing 2000
    • D. Harel and Y. Koren, "A Fast Multi-Scale Method for Drawing Large Graphs", Proceedings of Graph Drawing 2000, LNCS 1984, pp. 183-196.
    • LNCS , vol.1984 , pp. 183-196
    • Harel, D.1    Koren, Y.2
  • 9
    • 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
  • 10
    • 84947922995 scopus 로고    scopus 로고
    • Constraint-Based Spring-Model Algorithm for Graph Layout
    • Proceedings of Graph Drawing 95
    • T. Kamps, J. Kleinz and J. Read, "Constraint-Based Spring-Model Algorithm for Graph Layout", Proceedings of Graph Drawing 95, LNCS 1027, pp. 349-360.
    • LNCS , vol.1027 , pp. 349-360
    • Kamps, T.1    Kleinz, J.2    Read, J.3
  • 12
    • 84947901056 scopus 로고    scopus 로고
    • Generating Customized Layouts
    • Proceedings of Graph Drawing 95
    • X. Wang and I. Miyamoto, "Generating Customized Layouts" Proceedings of Graph Drawing 95, LNCS 1027, pp. 504-515.
    • LNCS , vol.1027 , pp. 504-515
    • Wang, X.1    Miyamoto, I.2


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