메뉴 건너뛰기




Volumn 2002-January, Issue , 2002, Pages 744-749

Spring embedder preprocessing for WWW visualization

Author keywords

Binary trees; Navigation; Optimization methods; Scattering; Springs; Usability; Visualization; World Wide Web

Indexed keywords

BINARY TREES; DRAWING (GRAPHICS); FLOW VISUALIZATION; NAVIGATION; SCATTERING; SPRINGS (COMPONENTS); THREE DIMENSIONAL COMPUTER GRAPHICS; WORLD WIDE WEB;

EID: 84948693272     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2002.1028861     Document Type: Conference Paper
Times cited : (12)

References (14)
  • 1
    • 84947908369 scopus 로고    scopus 로고
    • Fast interactive 3-D Graph visualization
    • I. Bru, A. Frick. Fast Interactive 3-D Graph Visualization. LNCS 1027. pp. 99-110. 1996.
    • (1996) LNCS , vol.1027 , pp. 99-110
    • Bru, I.1    Frick, A.2
  • 2
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • P. Eades. A Heuristic for Graph Drawing. Congressus Numerantium 42. pp. 149-60. 1984.
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 3
    • 84957542241 scopus 로고
    • A fast adaptive layout algorithm for undirected graphs. GD'94
    • A. Frick, A. Ludwig, H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. GD'94, LNCS 894. pp. 388-403. 1995.
    • (1995) LNCS , vol.894 , pp. 388-403
    • Frick, A.1    Ludwig, A.2    Mehldau, H.3
  • 5
    • 84958552647 scopus 로고    scopus 로고
    • A fast multi-scale method for drawing large graphs. GD 2000
    • D. Harel, Y. Koren. A Fast Multi-scale Method for Drawing Large Graphs. GD 2000, LNCS 1984. pp. 183-196. 2001.
    • (2001) LNCS , vol.1984 , pp. 183-196
    • Harel, D.1    Koren, Y.2
  • 9
    • 0032093266 scopus 로고    scopus 로고
    • Visualization of large nested graphs in 3D: Navigation and interaction
    • G. Parker, G. Franck, C. Ware. Visualization of Large Nested Graphs in 3D: Navigation and Interaction. J. Visual Languages and Computing, 9(3). pp. 299-317. 1998.
    • (1998) J. Visual Languages and Computing , vol.9 , Issue.3 , pp. 299-317
    • Parker, G.1    Franck, G.2    Ware, C.3
  • 11
    • 84958535557 scopus 로고    scopus 로고
    • FADE: Graph Drawing Clustering and Visual Abstraction. GD 2000
    • A. Quigley, P. Eades. FADE: Graph Drawing, Clustering, and Visual Abstraction. GD 2000, LNCS 1984. pp. 197-210. 2001.
    • (2001) LNCS , vol.1984 , pp. 197-210
    • Quigley, A.1    Eades, P.2
  • 12
    • 84957867098 scopus 로고    scopus 로고
    • JIGGLE: Java Interactive Graph Layout Algorithm. GD '98
    • D. Tunkelang. JIGGLE: Java Interactive Graph Layout Algorithm. GD '98, LNCS 1547. pp. 413-422. 1998.
    • (1998) LNCS , vol.1547 , pp. 413-422
    • Tunkelang, D.1
  • 13
    • 84958535270 scopus 로고    scopus 로고
    • A multilevel algorithm for force-Directed graph drawing. GD 2000
    • C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. GD 2000, LNCS 1984. pp. 171-182. 2001.
    • (2001) LNCS , vol.1984 , pp. 171-182
    • Walshaw, C.1
  • 14
    • 0033432394 scopus 로고    scopus 로고
    • Niche works-Interactive visualization of very large graphs
    • G.J. Wills. NicheWorks-Interactive Visualization of Very Large Graphs. J. Computational and Graphical Statistics 8,2 pp. 190-212. 1999.
    • (1999) J. Computational and Graphical Statistics , vol.8 , Issue.2 , pp. 190-212
    • Wills, G.J.1


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