請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38652完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 顏嗣鈞 | |
| dc.contributor.author | Yi-Yi Lee | en |
| dc.contributor.author | 李宜益 | zh_TW |
| dc.date.accessioned | 2021-06-13T16:40:38Z | - |
| dc.date.available | 2005-07-19 | |
| dc.date.copyright | 2005-07-19 | |
| dc.date.issued | 2005 | |
| dc.date.submitted | 2005-07-04 | |
| dc.identifier.citation | [1] P. Eades, W. Lai, K. Misue, and K. Sugiyama. (1991). Preserving the Mental Map of a Diagram. In Proceedings of Graphics, 91, 24-33.
[2] K. Misue, P. Eades, W. Lai, and K. Sugiyama. (1995). Layout Adjustment and the Mental Map. Journal of Visual Languages and Computing, 6:183–210. [3] K.-F. Böhringer and F. Newbery Paulisch. (1990) Using Constraints to Achieve Stability in Automatic Graph Layout Algorithms. Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, 43-51. [4] M. Kaufmann, R. Wiese. (2002). Maintaining the Mental Map for Circular Drawings. Proc. Symp. Graph Drawing GD’02, volume 2528 of Lecture Notes in Computer Science, 12–22. [5] R. Davidson and D. Harel. (1996). Drawing Graphs Nicely Using Simulated Annealing. ACM Transactions on Graphics, 15(4):301–331. [6] S. Bridgeman and R. Tamassia. (2002). A User Study in Similarity Measures for Graph Drawing. Journal of Graph Algorithms and Applications, vol. 6, no. 3, 225–254. [7] F. N. Paulisch and W. F. Tichy. (1990). Edge: an Extendible Directed Graph Editor. Software – Practice and Experience, 20(S1):63-88. [8] D. Harel and M. Sardas. (1998). Randomized Graph Drawing with Heavy-Duty Preprocessing. J. Visual Lang. and Comput. 6, 233-253. [9] M. A. Storey and H. A. Müller. (1995) Graph Layout Adjustment Strategies. Symp. Graph Drawing GD’95, volume 1207 of Lecture Notes in Computer Science, 487–99. [10] W. He, K. Marriott. (1998) Constrained Graph Layout. Constraints (4): 289-314. [11] R. A. Rensink.(2002) Change Detection. Annual Review of Psychology, 53: 245-277. [12] D. Fernandez-Duque and I. M. Thornton. (2000) Change Detection Without Awareness: Do Explicit Report Underestimate the Representation of Change in the Visual System? Visual Cognition, 7: 323-344. [13] J. Harrison, R.A. Rensink, and M. van de Panne. (2004) Obscuring Length Changes During Animated Motion. ACM Transactions on Graphics, 23: 569-573. [14] Franconeri, S. L., Hollingworth, A., & Simons (2005). Do New Objects Capture Attention? Psychological Science, 16(4), 275-281. [15] Simons, D. J., Mitroff, S. R., & Franconeri, S. L. (2003). Scene Perception: What We Can Learn from Visual Integration and Change Detection. In M. Peterson & G. Rhodes (Eds.), Perception of Faces, Objects, and Scenes: Analytic and Holistic Processes. Oxford: Oxford University Press. [16] Brockmole, J. R., & Henderson, J. M (2005). Object Appearance, Disappearance, and Attention Prioritization in Real-world Scenes. Psychonomic Bulletin & Review. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/38652 | - |
| dc.description.abstract | Information visualization has been widely used in many fields of science and engineering. As the importance of graphs increases, modifying graphs takes place very frequently. In the past, the concept of “mental map” has largely been ignored. Users have to spend a lot of time relearning the new graphs. In the long run this not only costs a lot of time but also because a painful work for the user since the graph size is getting larger and larger. This paper proposes an effective way to release the user from such kind of a distasteful job by maintaining a high degree of “mental map” when a graph is redrawn. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T16:40:38Z (GMT). No. of bitstreams: 1 ntu-94-R92921097-1.pdf: 600215 bytes, checksum: 64281f205abcd1bcaa0153632b45d82e (MD5) Previous issue date: 2005 | en |
| dc.description.tableofcontents | CHAPTER 1 INTRODUCTION 1
CHAPTER 2 DRAWING GRAPH NICELY 5 2.1 INTRODUCTION OF SIMULATED ANNEALING 5 2.2 THE GRAPH DRAWING ALGORITHM 7 2.2.1 Configuration: 7 2.2.2 Neighborhood: 7 2.2.3 The Cost Function: 7 2.2.4 The Cooling Schedule: 10 CHAPTER 3 MAINTAINING THE MENTAL MAP 13 3.1 INTRODUCTION OF MENTAL MAP 13 3.2 THE FRAMEWORK OF BRIDGEMAN 15 3.3 DRAWING THE GRAPHS AND PRESERVING MENTAL MAP 19 3.3.1 Configuration: 19 3.3.2 Neighborhood: 19 3.3.3 Cost Function: 20 3.3.4 The Cooling Schedule: 23 CHAPTER 4 EXPERIMENT RESULT 25 CHAPTER 5 CONCLUSION AND FUTURE WORK 38 REFERENCES 41 | |
| dc.language.iso | en | |
| dc.subject | 心像圖 | zh_TW |
| dc.subject | 模擬降溫法 | zh_TW |
| dc.subject | mental map | en |
| dc.subject | simulated annealing | en |
| dc.title | 利用模擬降溫法繪製良好且保持心像圖之圖形 | zh_TW |
| dc.title | Mental Map Preserving Graph Drawing Using Simulated Annealing | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 93-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 雷欽隆,呂學一,莊仁輝,黃秋煌 | |
| dc.subject.keyword | 模擬降溫法,心像圖, | zh_TW |
| dc.subject.keyword | simulated annealing,mental map, | en |
| dc.relation.page | 42 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2005-07-04 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電機工程學研究所 | zh_TW |
| 顯示於系所單位： | 電機工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-94-1.pdf 未授權公開取用 | 586.15 kB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。