메뉴 건너뛰기




Volumn 11, Issue 4, 2005, Pages 457-468

Topological fisheye views for visualizing large graphs

Author keywords

Large graph visualization; Topological fisheye

Indexed keywords

LARGE GRAPH VISUALIZATION; SPATIAL DENSITY; STRUCTURAL INFORMATION; TOPOLOGICAL FISHEYE;

EID: 22944461462     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2005.66     Document Type: Conference Paper
Times cited : (99)

References (30)
  • 2
    • 0000488282 scopus 로고    scopus 로고
    • The matrix market: A web resource for test matrix collections
    • R.F. Boisvert, ed., Chapman Hall, math.nist.gov/MatrixMarket
    • R.F. Boisvert et al., "The Matrix Market: A Web Resource for Test Matrix Collections," Quality of Numerical Software, Assessment and Enhancement, R.F. Boisvert, ed., pp. 125-137, Chapman Hall, 1997, math.nist.gov/MatrixMarket.
    • (1997) Quality of Numerical Software, Assessment and Enhancement , pp. 125-137
    • Boisvert, R.F.1
  • 4
    • 84992267980 scopus 로고    scopus 로고
    • Mapping the Internet
    • Apr.
    • W. Cheswick and H. Burch, "Mapping the Internet," Computer, vol. 32, no. 4, pp. 97-98, 102, Apr. 1999.
    • (1999) Computer , vol.32 , Issue.4 , pp. 97-98
    • Cheswick, W.1    Burch, H.2
  • 13
    • 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 Math., vol. 113, pp. 3-21, 2001.
    • (2001) Discrete Applied Math. , vol.113 , pp. 3-21
    • Hadany, R.1    Harel, D.2
  • 15
    • 3042854924 scopus 로고    scopus 로고
    • Improving graphical information system model use with elision and connecting lines
    • Mar.
    • J. Huotari, K. Lyytinen, and M. Niemel, "Improving Graphical Information System Model Use with Elision and Connecting Lines," ACM Trans. Computer-Human Interaction, vol. 11, no. 1, pp. 26-58, Mar. 2004.
    • (2004) ACM Trans. Computer-Human Interaction , vol.11 , Issue.1 , pp. 26-58
    • Huotari, J.1    Lyytinen, K.2    Niemel, M.3
  • 17
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs," SIAM J. Scientific Computing, vol. 20, pp. 359-392, 1998.
    • (1998) SIAM J. Scientific Computing , vol.20 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 18
    • 0024640140 scopus 로고
    • An algorithm for drawing general undirected graphs
    • T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, vol. 31, no. 1, pp. 7-15, 1989.
    • (1989) Information Processing Letters , vol.31 , Issue.1 , pp. 7-15
    • Kamada, T.1    Kawai, S.2
  • 19
    • 85014929888 scopus 로고    scopus 로고
    • Drawing huge graphs by algebraic multigrid optimization
    • Y. Koren, L. Carmel, and D. Harel, "Drawing Huge Graphs by Algebraic Multigrid Optimization," Multiscale Modeling and Simulation, vol. 1, no. 4, pp. 645-673, 2003.
    • (2003) Multiscale Modeling and Simulation , vol.1 , Issue.4 , pp. 645-673
    • Koren, Y.1    Carmel, L.2    Harel, D.3
  • 20
    • 22944469042 scopus 로고
    • The hyperbolic browser: A focus+context technique for visualizing large hierarchies
    • J. Lamping and R. Rao, "The Hyperbolic Browser: A Focus+Context Technique for Visualizing Large Hierarchies," J. Visual Languages and Computing, vol. 6, no. 4, 1995.
    • (1995) J. Visual Languages and Computing , vol.6 , Issue.4
    • Lamping, J.1    Rao, R.2
  • 21
    • 0028553622 scopus 로고
    • A linear-time construction of the relative neighborhood graph from the delaunay triangulation
    • A. Lingas, "A Linear-Time Construction of the Relative Neighborhood Graph from the Delaunay Triangulation," Computational Geometry, vol. 4, no. 4, pp. 199-208, 1994.
    • (1994) Computational Geometry , vol.4 , Issue.4 , pp. 199-208
    • Lingas, A.1
  • 23
    • 0031353494 scopus 로고    scopus 로고
    • H3: Laying out large directed graphs in 3D hyperbolic space
    • T. Munzner, "H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space," Proc. IEEE Symp. Information Visualization, pp. 2-10, 1997.
    • (1997) Proc. IEEE Symp. Information Visualization , pp. 2-10
    • Munzner, T.1
  • 24
    • 0027844947 scopus 로고
    • Exploring large hyperdocuments: Fisheye views of nested networks
    • E.G. Noik, "Exploring Large Hyperdocuments: Fisheye Views of Nested Networks," Proc. ACM Conf. Hypertext, pp. 102-205, 1993.
    • (1993) Proc. ACM Conf. Hypertext , pp. 102-205
    • Noik, E.G.1
  • 25
    • 0032093266 scopus 로고    scopus 로고
    • Visualization of large nested graphs in 3D: Navigation and interaction
    • G. Parker, G. Franck, and C. Ware, "Visualization of Large Nested Graphs in 3D: Navigation and Interaction," J. Visual Languages and Computing, vol. 9, no. 5, pp. 299-317, 1998.
    • (1998) J. Visual Languages and Computing , vol.9 , Issue.5 , pp. 299-317
    • Parker, G.1    Franck, G.2    Ware, C.3
  • 26
    • 84860972932 scopus 로고    scopus 로고
    • J. Petit, www.lsi.upc.es/jpetit/MinLA/Experiments, 2005.
    • (2005)
    • Petit, J.1
  • 28
    • 0002804341 scopus 로고    scopus 로고
    • Triangle: Engineering a 2D quality mesh generator and delaunay triangulator
    • J.R. Shewchuk, "Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator," Proc. First Workshop Applied Computational Geometry, pp. 124-133, 1996, www.cs.cmu. edu/quake/triangle.html.
    • (1996) Proc. First Workshop Applied Computational Geometry , pp. 124-133
    • Shewchuk, J.R.1
  • 29
    • 84860972930 scopus 로고    scopus 로고
    • C. Walshaw www.gre.ac.uk/c.walshaw/partition, 2005.
    • (2005)
    • Walshaw, C.1
  • 30
    • 4043141349 scopus 로고    scopus 로고
    • A multilevel algorithm for force-directed graph drawing
    • C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing," J. Graph Algorithms and Applications, vol. 7, no. 3, pp. 253-285, 2003.
    • (2003) J. Graph Algorithms and Applications , vol.7 , Issue.3 , pp. 253-285
    • Walshaw, C.1


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