Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 電機工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/32630
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor顏嗣鈞
dc.contributor.authorWei Chengen
dc.contributor.author鄭維zh_TW
dc.date.accessioned2021-06-13T04:12:34Z-
dc.date.available2012-08-01
dc.date.copyright2011-08-01
dc.date.issued2011
dc.date.submitted2011-07-28
dc.identifier.citation[1] K. Kaufmann and D. Wagner (Eds.), ‘Drawing Graphs: Methods and Models’, Vol. 2025 of Lecture Notes in Computer Science, Springer, (2001).
[2] H. C. Purchase, ‘Metrics for Graph Drawing Aesthetics’, Journal of Visual Languages and Computing 13 (5) , 501-516, (2002).
[3] http://docs.yworks.com/yfiles/doc/developers-guide/major_layouters.html
[4] P. Eades, 'A Heuristic for Graph Drawing', Congressus Nutnerantiunt, 42, 149-160 (1984).
[5] T. M. J. Fruchterman and E. M. Reingold. 'Graph Drawing by Force-Directed Placement'. Softw. Pract. Exper., 21 (11), 1129-1164 (1991).
[6] T. Kamada and S. Kawai, 'An Algorithm for Drawing General Undirected Graphs', Information Processing Letters, 31 (l), 7-15 (1989).
[7] Y. Lee, C. Lin, and H. Yen, 'Mental Map Preserving Graph Drawing Using Simulated Annealing', ser. Conferences in Research and Practice in Information Technology, vol. 60, (2006).
[8] M. Kaufmann and R. Wiese, 'Maintaining the Mental Map for Circular Drawings', Proceedings of Graph Drawing 2002, Vol. 2528 of Lecture Notes in Computer Science, 12-22, (2002).
[9] P. Eades, W. Lai, K. Misue, and K. Sugiyama, 'Preserving the Mental Map of a Diagram', Proceedings of Compugraphics 91, 24-33 (1991).
[10] K. Misue, P. Eades, W. Lai, and K. Sugiyama, 'Layout Adjustment and the Mental Map', Journal of Visual Languages and Computing 6 (2), 183-210 (1995).
[11] M. L. Huang, P. Eades, and J. Wang, ‘Online Animated Graph Drawing Using a Modified Spring Algorithm’, Journal of Visual Languages and Computing, 9(6), (1998).
[12] F. Newbery Paulisch and W. F. Tichy, 'Edge: an Extendible Directed Graph Editor', Software - Practice and Experience, 20 (S1), 63-88, (1990).
[13] C. Collberg, S. Kobourov, J. Nagra, J. Pitts, and K. Wampler, 'A System for Graph-based Visualization of the Evolution of Software', Proceedings of the 2003 ACM Symposium on Software Visualization, 77-86, (2003).
[14] S. C. North, 'Incremental layout in DynaDag', Proc. 3rd Int. Symp. Graph Drawing, no. 1027 in LNCS, 409-418, (1995).
[15] Y. Frishman and A. Tal, 'Online Dynamic Graph Drawing', EuroVis, 75-82, (2007).
[16] S. Bridgeman and R. Tamassia, 'A User Study in Similarity Measures for Graph Drawing', Journal of Graph Algorithms and Applications 6 (3), 225-254, (2002).
[17] D. Forrester, S. G. Kobourov, A. Navabi, K. Wampler, and G. V. Yee, 'Graphael: A System for Generalized Force-Directed Layouts', Pach, J. (ed.) GD 2004. LNCS, vol. 3383, 454-464, (2005).
[18] H. C. Purchase and A. Samra, 'Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs', Proc. Diagrammatic Representation and Inference (Diagrams' 08), LNAI 5223, 60-73, (2008).
[19] R. Davidson and D. Harel, 'Drawing graphs nicely using simulated annealing', ACM Transactions on Graphics 15 (4), 301-331, (1996).
[20] F. Bertault, ‘A force-directed algorithm that preserves edge crossing properties’, Graph Drawing’99, Lecture Notes in Computer Science, Vol. 1731, 351-358, Springer-Verlag, (1999).
[21] C. Lin and H. Yen, ‘A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion’, Proc. of 9th International Conference on Information Visualisation (IV05), IEEE CS Press, 329-334, London, UK, (2005).
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/32630-
dc.description.abstract圖形繪製是資訊圖像表示的重要課題之一,應用層面甚廣。因應圖形繪製中對於系統互動與呈現資料庫改變--稱之為動態圖形繪製--的需求,我們必須在演算法加入「心像圖維持」這個要素。若在動態圖形繪製問題中,重新繪製時沒有考慮到兩張圖的前後關連,單純在每次改變後重新繪製,有很大的可能圖形的架構會改變而影響使用者的辨識。若可以在前一張圖的基礎下進行修改而成為下一張圖,同時顧及避免基本架構改變與對圖形整齊之需求等兩要素,即可達到心像圖維持的要求。本篇論文建基於泛用性與速度均佳的彈簧演算法,提出一個與前人有所差異的觀點,並依此設計了一套新的心像圖維持演算法。zh_TW
dc.description.abstractGraph drawing is an important topic in the domain of information visualization. For needs of interaction with a drawing system or data transition presentation, called 'dynamic graph drawing', we should consider to add a factor called 'mental map preservation' into the current algorithm. In a dynamic drawing problem, if we ignore relations between the new graph and the old one while redrawing the former, but just let the algorithm auto-redraw along with data transition, it's possible that the layout structure of the new one differs from the old one, and then sways human users' ease of identification. We can achieve preserving users' mental map if we can look after both avoidance of structure swaying and need of layout neatness when redrawing the layout from the old graph to the new one. This paper, based on the spring algorithm having a balance between speed and robustness, proposes a view different from former researches, and designs a new mental map preserving algorithm according to that.en
dc.description.provenanceMade available in DSpace on 2021-06-13T04:12:34Z (GMT). No. of bitstreams: 1
ntu-100-R96921060-1.pdf: 616401 bytes, checksum: 95c20667614d452b4cef7fe151991ae3 (MD5)
Previous issue date: 2011
en
dc.description.tableofcontents口試委員會審定書 #
誌謝 i
中文摘要 ii
ABSTRACT iii
目錄 iv
圖目錄 v
表格目錄 vi
Chapter 1 介紹 1
Chapter 2 彈簧演算法及心像圖之維持 7
2.1 Fruchterman-Reingold彈簧演算法 7
2.2 加入心像圖維持之要素 12
2.2.1 維持心像圖的策略 13
2.2.2 方法流程 16
Chapter 3 實驗結果 18
3.1 實驗環境及結果 18
3.2 實驗結果討論 33
Chapter 4 結論與未來展望 51
參考資料 52
dc.language.isozh-TW
dc.subject彈簧演算法zh_TW
dc.subject使用者介面zh_TW
dc.subject演算法zh_TW
dc.subject心像圖zh_TW
dc.subject圖形使用者介面zh_TW
dc.subject設計zh_TW
dc.subject圖形繪製zh_TW
dc.subject施力模型zh_TW
dc.subjectgraphical user interfacesen
dc.subjectuser interfacesen
dc.subjectalgorithmsen
dc.subjectdesignen
dc.subjectgraph drawingen
dc.subjectmental mapen
dc.subjectforce modelen
dc.subjectspring algorithmsen
dc.title使用彈簧演算法描繪良好且維持心像圖之圖形zh_TW
dc.titleMental Map Preserving Graph Drawing Using Spring Algorithmsen
dc.typeThesis
dc.date.schoolyear99-2
dc.description.degree碩士
dc.contributor.oralexamcommittee郭斯彥,莊仁輝,雷欽隆,黃秋煌
dc.subject.keyword演算法,設計,圖形繪製,圖形使用者介面,心像圖,使用者介面,彈簧演算法,施力模型,zh_TW
dc.subject.keywordalgorithms,design,graph drawing,graphical user interfaces,mental map,user interfaces,spring algorithms,force model,en
dc.relation.page53
dc.rights.note有償授權
dc.date.accepted2011-07-28
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept電機工程學研究所zh_TW
顯示於系所單位:電機工程學系

文件中的檔案:
檔案 大小格式 
ntu-100-1.pdf
  未授權公開取用
601.95 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved