메뉴 건너뛰기




Volumn 18, Issue 8, 2012, Pages 1330-1342

Coherent time-varying graph drawing with multifocus+context interaction

Author keywords

focus+context visualization; Graph drawing; spatiotemporal coherence; time varying graphs

Indexed keywords

AESTHETIC QUALITIES; CONTEXT VISUALIZATION; FOCUS + CONTEXT; FOCUS+CONTEXT VISUALIZATION; GRAPH DRAWING; GRAPH LAYOUT ALGORITHMS; GRAPH VISUALIZATION; INITIAL GRAPH; MENTAL MAPS; MULTI-FOCUS; OPTIMIZATION PROBLEMS; SPATIOTEMPORAL COHERENCE; SUPER GRAPH; TIME SEQUENCES; TIME VARYING;

EID: 84862591012     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2011.128     Document Type: Article
Times cited : (35)

References (32)
  • 1
    • 0037960597 scopus 로고    scopus 로고
    • Drawing on physical analogies
    • U. Brandes, "Drawing on Physical Analogies," Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds., pp. 71-86, Springer-Verlag, 2001. (Pubitemid 33267301)
    • (2001) Lecture Notes in Computer Science , Issue.2025 , pp. 71-86
    • Brandes, U.1
  • 2
    • 84957380248 scopus 로고    scopus 로고
    • A bayesian paradigm for dynamic graph layout
    • Graph Drawing
    • U. Brandes and D. Wagner, "A Bayesian Paradigm for Dynamic Graph Layout," Proc. Int'l Symp. Graph Drawing, pp. 236-247, 1997. (Pubitemid 128012909)
    • (1997) Lecture Notes in Computer Science , Issue.1353 , pp. 236-247
    • Brandes, U.1    Wagner, D.2
  • 3
    • 8844244248 scopus 로고    scopus 로고
    • Dynamic graph drawing
    • J. Branke, "Dynamic Graph Drawing," Drawing Graphs: Methods and Models, M. Kaufmann and D. Wagner, eds., pp. 228-246, Springer-Verlag, 2001. (Pubitemid 33267306)
    • (2001) Lecture Notes in Computer Science , Issue.2025 , pp. 228-246
    • Branke, J.1
  • 4
    • 77952611196 scopus 로고    scopus 로고
    • Concurrent number cruncher: A gpu implementation of a general sparse linear solver
    • L. Buatois, G. Caumon, and B. Lévy, "Concurrent Number Cruncher: A GPU Implementation of a General Sparse Linear Solver," Int'l J. Parallel, Emergent and Distributed Systems, vol. 24, no. 3, pp. 205-223, 2009.
    • (2009) Int'l J. Parallel, Emergent and Distributed Systems , vol.24 , Issue.3 , pp. 205-223
    • Buatois, L.1    Caumon, G.2    Lévy, B.3
  • 7
    • 0001070640 scopus 로고
    • A heuristic for graph drawing
    • P. Eades, "A Heuristic for Graph Drawing," Congressus Numerantium, vol. 42, pp. 149-160, 1984.
    • (1984) Congressus Numerantium , vol.42 , pp. 149-160
    • Eades, P.1
  • 11
    • 85035495585 scopus 로고
    • Generalized fisheye views
    • G.W. Furnas, "Generalized Fisheye Views," ACM SIGCHI Bull., vol. 17, no. 4, pp. 16-23, 1986.
    • (1986) ACM SIGCHI Bull. , vol.17 , Issue.4 , pp. 16-23
    • Furnas, G.W.1
  • 12
    • 33745871238 scopus 로고    scopus 로고
    • A fisheye follow-up: Further reflections on focus + context
    • CHI 2006: Conference on Human Factors in Computing Systems, Conference Proceedings SIGCHI
    • G.W. Furnas, "A Fisheye Follow-Up: Further Reflections on Focus+Context," Proc. ACM SIGCHI Conf. Human Factors in Computing Systems, pp. 999-1008, 2006. (Pubitemid 44032193)
    • (2006) Conference on Human Factors in Computing Systems - Proceedings , vol.2 , pp. 999-1008
    • Furnas, G.W.1
  • 14
    • 77955115496 scopus 로고    scopus 로고
    • Efficient, proximity-preserving node overlap removal
    • E.R. Gansner and Y. Hu, "Efficient, Proximity-Preserving Node Overlap Removal," J. Graph Algorithms and Applications, vol. 14, no. 1, pp. 53-74, 2010.
    • (2010) J. Graph Algorithms and Applications , vol.14 , Issue.1 , pp. 53-74
    • Gansner, E.R.1    Hu, Y.2
  • 15
    • 24144496062 scopus 로고    scopus 로고
    • Graph drawing by stress majorization
    • Graph Drwing - 12th International Symposium, GD 2004
    • E.R. Gansner, Y. Koren, and S. North, "Graph Drawing by Stress Majorization," Proc. Int'l Symp. Graph Drawing, pp. 239-250, 2005. (Pubitemid 41239567)
    • (2004) Lecture Notes in Computer Science , vol.3383 , pp. 239-250
    • Gansner, E.R.1    Koren, Y.2    North, S.3
  • 16
    • 24144460578 scopus 로고    scopus 로고
    • Dynamic graph drawing of sequences of orthogonal and hierarchical graphs
    • C. Gö rg, P. Birke, M. Pohl, and S. Diehl, "Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs," Proc. Int'l Symp. Graph Drawing, pp. 228-238, 2005.
    • (2005) Proc. Int'l Symp. Graph Drawing , pp. 228-238
    • Görg, C.1    Birke, P.2    Pohl, M.3    Diehl, S.4
  • 17
    • 16244384883 scopus 로고    scopus 로고
    • Graph drawing by high-dimensional embedding
    • D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding," Proc. Int'l Symp. Graph Drawing, pp. 299-345, 2002.
    • (2002) Proc. Int'l Symp. Graph Drawing , pp. 299-345
    • Harel, D.1    Koren, Y.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
    • 33845617967 scopus 로고    scopus 로고
    • Visual exploration of complex time-varying graphs
    • DOI 10.1109/TVCG.2006.193
    • G. Kumar and M. Garland, "Visual Exploration of Complex Time-Varying Graphs," IEEE Trans. Visualization and Computer Graphics, vol. 12, no. 5, pp. 805-812, Sept. 2006. (Pubitemid 44955607)
    • (2006) IEEE Transactions on Visualization and Computer Graphics , vol.12 , Issue.5 , pp. 805-812
    • Kumar, G.1    Garland, M.2
  • 22
    • 84947918909 scopus 로고
    • Incremental layout in dynaDAG
    • S.C. North, "Incremental Layout in DynaDAG," Proc. Int'l Symp. Graph Drawing, pp. 409-418, 1996. (Pubitemid 126025108)
    • (1995) Lecture Notes in Computer Science , Issue.1027 , pp. 409-418
    • North, S.C.1
  • 23
    • 56749101933 scopus 로고    scopus 로고
    • How important is the "mental map"?-An empirical investigation of a dynamic graph layout algorithm
    • H.C. Purchase, E. Hoggan, and C. Gö rg, "How Important Is the "Mental Map"? -An Empirical Investigation of a Dynamic Graph Layout Algorithm," Proc. Int'l Symp. Graph Drawing, pp. 184-195, 2006.
    • (2006) Proc. Int'l Symp. Graph Drawing , pp. 184-195
    • Purchase, H.C.1    Hoggan, E.2    Görg, C.3
  • 24
    • 56549101391 scopus 로고    scopus 로고
    • Extremes are better: Investigating mental map preservation in dynamic graphs
    • H.C. Purchase and A. Samra, "Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs," Proc. Int'l Symp. Graph Drawing, pp. 60-73, 2008.
    • (2008) Proc. Int'l Symp. Graph Drawing , pp. 60-73
    • Purchase, H.C.1    Samra, A.2
  • 27
    • 84940605935 scopus 로고    scopus 로고
    • Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
    • Applied Computational Geometry: Towards Geometric Engineering
    • J.R. Shewchuk, "Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator," Proc. ACM Workshop Applied Computational Geometry, pp. 203-222, 1996. (Pubitemid 126140158)
    • (1996) Lecture Notes in Computer Science , Issue.1148 , pp. 203-222
    • Shewchuk, J.R.1
  • 28
    • 54949087849 scopus 로고    scopus 로고
    • Importance-driven time-varying data visualization
    • Nov./Dec.
    • C. Wang, H. Yu, and K.-L. Ma, "Importance-Driven Time-Varying Data Visualization," IEEE Trans. Visualization and Computer Graphics, vol. 14, no. 6, pp. 1547-1554, Nov./Dec. 2008.
    • (2008) IEEE Trans. Visualization and Computer Graphics , vol.14 , Issue.6 , pp. 1547-1554
    • Wang, C.1    Yu, H.2    Ma, K.-L.3
  • 31
    • 78650168775 scopus 로고    scopus 로고
    • Feature-preserving volume data reduction and focus+context visualization
    • Feb.
    • Y.-S. Wang, C. Wang, T.-Y. Lee, and K.-L. Ma, "Feature-Preserving Volume Data Reduction and Focus+Context Visualization," IEEE Trans. Visualization and Computer Graphics, vol. 17, no. 2, pp. 171-181, Feb. 2011.
    • (2011) IEEE Trans. Visualization and Computer Graphics , vol.17 , Issue.2 , pp. 171-181
    • Wang, Y.-S.1    Wang, C.2    Lee, T.-Y.3    Ma, K.-L.4


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