簡易檢索 / 詳目顯示

研究生: 李彥廷
Lee, Yen-Ting
論文名稱: 動態重要度視覺化:以NBA為例
Time-varying Visualization for NBA Game Results
指導教授: 李同益
Lee, Tong-Yee
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2016
畢業學年度: 104
語文別: 英文
論文頁數: 40
中文關鍵詞: 重要度視覺化重要度等高線粒子流地圖視覺化美國職業籃球聯盟籃球
外文關鍵詞: Time-varying visualization, Importance visualization, Map visualization, flow visualization, NBA, basketball, particle flow
相關次數: 點閱:71下載:9
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 地圖視覺化相關研究中,流型圖結合地圖及流程圖,以不同寬度、顏色的線段及箭號呈現兩地間量化資料的移動;比例符號圖透過在地圖位置上建立不同尺寸的圓形、圓餅圖或圖示來表示各地區量化資料的大小。大部分的地圖視覺化研究著重在靜態的方法上,然而靜態的視覺化只能提供單一且有限的資訊給使用者。本論文提出新的動態重要度視覺化方法,以地理學等高線的概念,在地圖邊界外圍建立不同大小的同心橢圓形重要度等高線,將資料圖示經最佳化計算重新排列到相對應的重要度等高線,以動畫和粒子流呈現資料重要度的變化過程,並結合使用者互動式介面來觀察不同面向的重要度改變過程。

    In map visualization, flow maps combine map and flow charts, use flow charts with different size and color to show the quantitative data moving between two places on the map. Proportional symbol maps put different size of discs, pie charts or images to the corresponding location on the map for showing different quantitative data. However, most of the research focus on static methods, and static visualization can only provide limited information to the users. This paper proposed a novel dynamic importance visualization method. Use the concept of geographical contour line, we create several concentric ellipse called ”importance contour line” that surrounding the map border. And use optimization method to rearrange the representative logo to the corresponding ellipse. We show the importance change process through animation and use particle flow for representing the relationship between two data set. We provide user interface for showing different aspects of the importance change process.

    摘要i Abstract ii 誌謝iii Table of Contents iv List of Figures v Chapter 1. Introduction . . . 1 Chapter 2. Related Work . . . 3 Chapter 3. Method . . . 7 3.1. Data preprocessing . . . 8 3.2. Ellipse importance contour lines and the arrangement of representative logos . . . 9 3.3. The connection between data sets . . . 14 3.4. Animation design . . . 15 3.5. User interface . . . 22 Chapter 4. Results . . . 24 Chapter 5. Conclusion and Future work . . . 38 References . . . 39

    [1] Kevin Verbeek Bettina Speckmann. Necklace maps. IEEE Transactions on Visualization and Computer Graphics, 16:881–889, 2010.
    [2] Sergio Cabello, Herman Haverkort, Marc van Kreveld, and Bettina Speckmann. Algorithmic aspects of proportional symbol maps. Algorithmica, 58(3):543–565, 2010.
    [3] Kwan-Liu Ma Chaoli Wang, Hongfeng Yu. Importance-driven time-varying data visualization. IEEE Transactions on Visualization and Computer Graphics, 14:1547–1554, 2008.
    [4] Stephen Kobourov Daisuke Mashima and Yifan Hu. Visualizing dynamic data with maps. IEEE Transactions on Visualization and Computer Graphics, 18:1424–1437, 2012.
    [5] Marc van Kreveld David Eppstein, Bettina Speckmann, and Frank Staals. Improved grid map layout by point set matching. In IEEE Pacific Visualization Symposium, pages
    25–32. IEEE, 2013.
    [6] Stephen Kobourov Emden R. Gansner, Yifan Hu. Gmap: Visualizing graphs and clusters as maps. In IEEE Pacific Visualization Symposium, pages 201–208. IEEE, 2010.
    [7] Steven L. Franconeri George A. Alvarez. How many objects can you track? evidence for a resource-limited attentive tracking mechanism. Journal of Vision, 0:1–10, 2007.
    [8] Cid Souza Guilherme Kunigami, Pedro Rezende and Tallys Yunes. Determining an optimal visualization of physically realizable symbol maps. In SIBGRAPI Conference
    on Graphics, Patterns and Images, pages 117–124, 2011.
    [9] Diansheng Guo. Flow mapping and multivariate visualization of large spatial interaction data. IEEE Transactions on Visualization and Computer Graphics, 15:1041–1048, 2009.
    [10] Mark Harrower. Tips for designing effective animated maps. Cartographic Perspectives, pages 63–65, 2003.
    [11] Danny Holten. Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics, 12:741–748, 2006.
    [12] Yifan Hu, Stephen Kobourov, and Sankar Veeramoni. On Maximum Differential Graph Coloring, pages 274–286. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011.
    [13] Saladi Rahul John Gunnar Carlsson, Benjamin Armbruster and Haritha Bellam. A bottleneck matching problem with edgecrossing constraints. International Journal of Computational Geometry and Applications, 25:256–261, 2016.
    [14] Kevin Verbeek Kevin Buchin, Bettina Speckmann. Flow map layout via spiral trees. IEEE Transactions on Visualization and Computer Graphics, 17:2536–2544, 2011.
    [15] Andre Schulz Martin Fink, Jan-Henrik Haunert, Joachim Spoerhase, and Alexander Wolff. Algorithms for labeling focus regions. IEEE Transactions on Visualization and Computer Graphics, 18:2583–2592, 2012.
    [16] Doantam Phan, Ling Xiao, Ron Yeh, Pat Hanrahan, and Terry Winograd. Flow map layout. In Proceedings of the Proceedings of the 2005 IEEE Symposium on Information
    Visualization, INFOVIS ’05, pages 29–33, 2005.
    [17] Sungahn Ko Ross Maciejewski, Avin Pattath, Ryan Hafen, William S. Cleveland, and David S. Ebert. Automated box-cox transformations for improved visual encoding. IEEE Transactions on Visualization and Computer Graphics, 19:130–140, 2012.
    [18] Marc van Kreveld, Étienne Schramm, and Alexander Wolff. Algorithms for the placement of diagrams on maps. In Proceedings of the 12th Annual ACM International Workshop on Geographic Information Systems, GIS ’04, pages 222–231, New York, NY, USA, 2004. ACM.

    下載圖示 校內:2021-08-01公開
    校外:2021-08-01公開
    QR CODE