메뉴 건너뛰기




Volumn 22, Issue 1, 2016, Pages 349-358

HOLA: Human-like Orthogonal Network Layout

Author keywords

Algorithm design and analysis; Layout; Manuals; Software; Software algorithms; Standards; Visualization

Indexed keywords

COMPUTER SOFTWARE; FLOW VISUALIZATION; HEURISTIC METHODS; STANDARDS;

EID: 84947087250     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVCG.2015.2467451     Document Type: Conference Paper
Times cited : (84)

References (36)
  • 2
    • 84947086376 scopus 로고    scopus 로고
    • Page with our detailed results for the formative study
    • Page with our detailed results for the formative study http://data.graphlayout.net/HOLA/formative.
  • 3
    • 84947086377 scopus 로고    scopus 로고
    • Page with our detailed results for the summative study
    • Page with our detailed results for the summative study http://data.graphlayout.net/HOLA/summative.
  • 8
    • 79952265030 scopus 로고    scopus 로고
    • Topology-driven force-directed algorithms
    • Springer
    • W. Didimo, G. Liotta, and S. A. Romeo. Topology-driven force-directed algorithms. In Graph Drawing, pages 165-176. Springer, 2011.
    • (2011) Graph Drawing , pp. 165-176
    • Didimo, W.1    Liotta, G.2    Romeo, S.A.3
  • 13
  • 16
    • 0345749204 scopus 로고
    • Comparing and evaluating layout algorithms within GraphEd
    • M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. Journal of Visual Languages and Computing, 6(3):255-273, 1995.
    • (1995) Journal of Visual Languages and Computing , vol.6 , Issue.3 , pp. 255-273
    • Himsolt, M.1
  • 17
    • 33845640864 scopus 로고    scopus 로고
    • Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
    • D. Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. Visualization and Computer Graphics, IEEE Transactions on, 12(5):741-748, 2006.
    • (2006) Visualization and Computer Graphics, IEEE Transactions on , vol.12 , Issue.5 , pp. 741-748
    • Holten, D.1
  • 19
    • 70449370885 scopus 로고    scopus 로고
    • Effects of sociogram drawing conventions and edge crossings in social network visualization
    • W. Huang, S.-H. Hong, and P. Eades. Effects of sociogram drawing conventions and edge crossings in social network visualization. J. Graph Algorithms Appl., 11(2):397-429, 2007.
    • (2007) J. Graph Algorithms Appl. , vol.11 , Issue.2 , pp. 397-429
    • Huang, W.1    Hong, S.-H.2    Eades, P.3
  • 20
    • 84891855207 scopus 로고    scopus 로고
    • Incremental grid-like layout using soft and hard constraints
    • Springer
    • S. Kieffer, T. Dwyer, K. Marriott, and M. Wybrow. Incremental grid-like layout using soft and hard constraints. In Graph Drawing, pages 448-459. Springer, 2013.
    • (2013) Graph Drawing , pp. 448-459
    • Kieffer, S.1    Dwyer, T.2    Marriott, K.3    Wybrow, M.4
  • 21
    • 0342825403 scopus 로고
    • Fast detection and display of symmetry in trees
    • J. Manning and M. J. Atallah. Fast detection and display of symmetry in trees. Congressus Numerantium, (64):159-169, 1988.
    • (1988) Congressus Numerantium , Issue.64 , pp. 159-169
    • Manning, J.1    Atallah, M.J.2
  • 23
    • 0031206085 scopus 로고    scopus 로고
    • The effect of spatial arrangement on judgments and errors in interpreting graphs
    • C. McGrath, J. Blythe, and D. Krackhardt. The effect of spatial arrangement on judgments and errors in interpreting graphs. Social Networks, 19(3):223-242, 1997.
    • (1997) Social Networks , vol.19 , Issue.3 , pp. 223-242
    • McGrath, C.1    Blythe, J.2    Krackhardt, D.3
  • 24
    • 84957362320 scopus 로고    scopus 로고
    • Which aesthetic has the greatest effect on human understanding?
    • Springer
    • H. Purchase. Which aesthetic has the greatest effect on human understanding? In Graph Drawing, pages 248-261. Springer, 1997.
    • (1997) Graph Drawing , pp. 248-261
    • Purchase, H.1
  • 25
    • 0032335892 scopus 로고    scopus 로고
    • Performance of layout algorithms: Comprehension, not computation
    • H. C. Purchase. Performance of layout algorithms: Comprehension, not computation. Journal of Visual Languages & Computing, 9(6):647-657, 1998.
    • (1998) Journal of Visual Languages & Computing , vol.9 , Issue.6 , pp. 647-657
    • Purchase, H.C.1
  • 28
    • 84947939402 scopus 로고    scopus 로고
    • Validating graph drawing aesthetics
    • Springer
    • H. C. Purchase, R. F. Cohen, and M. James. Validating graph drawing aesthetics. In Graph Drawing, pages 435-446. Springer, 1996.
    • (1996) Graph Drawing , pp. 435-446
    • Purchase, H.C.1    Cohen, R.F.2    James, M.3
  • 31
    • 84915747648 scopus 로고    scopus 로고
    • Stress-minimizing orthogonal layout of data flow diagrams with ports
    • Springer
    • U. Rüegg, S. Kieffer, T. Dwyer, K. Marriott, and M. Wybrow. Stress-minimizing orthogonal layout of data flow diagrams with ports. In Graph Drawing, pages 319-330. Springer, 2014.
    • (2014) Graph Drawing , pp. 319-330
    • Rüegg, U.1    Kieffer, S.2    Dwyer, T.3    Marriott, K.4    Wybrow, M.5
  • 32
    • 0000488788 scopus 로고
    • Network structure and minimum degree
    • S. B. Seidman. Network structure and minimum degree. Social networks, 5(3):269-287, 1983.
    • (1983) Social Networks , vol.5 , Issue.3 , pp. 269-287
    • Seidman, S.B.1
  • 36
    • 77951589618 scopus 로고    scopus 로고
    • Orthogonal connector routing
    • Springer
    • M. Wybrow, K. Marriott, and P. J. Stuckey. Orthogonal connector routing. In Graph Drawing, pages 219-231. Springer, 2010.
    • (2010) Graph Drawing , pp. 219-231
    • Wybrow, M.1    Marriott, K.2    Stuckey, P.J.3


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