We have developed an Origami system in which we can fold a sheet of paper freely. In mathematical model, two held sides of paper can be overlapped flatly. However, in real paper, the sides often make a gap between them because of physical restrictions. In this paper, we formalize “folding” in Origami and discuss how to make such “gap” in 3D Origami simulation system to make it more realistic. We apply a biphase model, which consists of two models. One of them is mathematical model for managing folding, and the other is graphical gap-model for representing Origami with gaps. We show Origami figures made by the two models and discuss the effect of the method we applied and some problems to be solved.
{"title":"A Bi-phase Model of Folding Origami Interactively with Gap Representation","authors":"Mariko Sasakura, Kengo Tanaka, Emika Yamashita, Hiroyuki Tanabe, Takeshi Kawakami","doi":"10.1109/IV.2013.65","DOIUrl":"https://doi.org/10.1109/IV.2013.65","url":null,"abstract":"We have developed an Origami system in which we can fold a sheet of paper freely. In mathematical model, two held sides of paper can be overlapped flatly. However, in real paper, the sides often make a gap between them because of physical restrictions. In this paper, we formalize “folding” in Origami and discuss how to make such “gap” in 3D Origami simulation system to make it more realistic. We apply a biphase model, which consists of two models. One of them is mathematical model for managing folding, and the other is graphical gap-model for representing Origami with gaps. We show Origami figures made by the two models and discuss the effect of the method we applied and some problems to be solved.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"325 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117184516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Annika H. Holmbom, Peter Sarlin, Zhiyuan Yao, T. Eklund, B. Back
There is an increasing interest in green consumer behavior. These consumers are ecologically conscious and interested in buying environmentally friendly products. Earlier efforts at identifying these consumers have relied upon questionnaires based on demographic and psychographic data. Most of the studies have concluded that it is not possible to identify a unanimous profile for a green consumer, because: (1) there might be several profiles for green consumers, and (2) in questionnaires, consumers tend to answer according to their intentions, not according to actual behavior. We apply a new method, the Weighted Self-Organizing Map (WSOM) for visual customer segmentation in order to profile green consumers. The consumers are identified through a data-driven analysis based on actual transaction data, including both demographic and behavioral information. The WSOM accounts for the 'degree' of how green a consumer is by giving a larger weight to consumers who buy more green products. The identified profiles are verified by comparison to earlier research.
{"title":"Visual Data-Driven Profiling of Green Consumers","authors":"Annika H. Holmbom, Peter Sarlin, Zhiyuan Yao, T. Eklund, B. Back","doi":"10.1109/IV.2013.37","DOIUrl":"https://doi.org/10.1109/IV.2013.37","url":null,"abstract":"There is an increasing interest in green consumer behavior. These consumers are ecologically conscious and interested in buying environmentally friendly products. Earlier efforts at identifying these consumers have relied upon questionnaires based on demographic and psychographic data. Most of the studies have concluded that it is not possible to identify a unanimous profile for a green consumer, because: (1) there might be several profiles for green consumers, and (2) in questionnaires, consumers tend to answer according to their intentions, not according to actual behavior. We apply a new method, the Weighted Self-Organizing Map (WSOM) for visual customer segmentation in order to profile green consumers. The consumers are identified through a data-driven analysis based on actual transaction data, including both demographic and behavioral information. The WSOM accounts for the 'degree' of how green a consumer is by giving a larger weight to consumers who buy more green products. The identified profiles are verified by comparison to earlier research.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128953602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ashish Amresh, John C. Femiani, J. Fairfield, Adam J. Fairfield
Heat map based data visualization and mining is an emerging area in game engine design and architecture. Employed by many state of the art game engines and popular commercial games, this technology helps populate and collate player activity and behavior to better inform the system for further action. Simulation and serious games can tremendously benefit by applying heat map based visualization for the purposes of analyzing and tracking player behavior. Heat maps are time varying texture maps that represent a chosen activity over a certain grid at any particular interval of elapsed time. In this paper results of applying a real-time heat map data capture and generation tool on two military simulations: 1) Ground-based combat scenario and 2) Unmanned Aerial Vehicle sensor operator scenario is presented. The research showcases several real-time visualization techniques developed into the simulation with the main goal of understanding participant behavior. Novice and expert data is populated as part of the experiment to validate the effectiveness of our methods.
{"title":"UAV Sensor Operator Training Enhancement through Heat Map Analysis","authors":"Ashish Amresh, John C. Femiani, J. Fairfield, Adam J. Fairfield","doi":"10.1109/IV.2013.60","DOIUrl":"https://doi.org/10.1109/IV.2013.60","url":null,"abstract":"Heat map based data visualization and mining is an emerging area in game engine design and architecture. Employed by many state of the art game engines and popular commercial games, this technology helps populate and collate player activity and behavior to better inform the system for further action. Simulation and serious games can tremendously benefit by applying heat map based visualization for the purposes of analyzing and tracking player behavior. Heat maps are time varying texture maps that represent a chosen activity over a certain grid at any particular interval of elapsed time. In this paper results of applying a real-time heat map data capture and generation tool on two military simulations: 1) Ground-based combat scenario and 2) Unmanned Aerial Vehicle sensor operator scenario is presented. The research showcases several real-time visualization techniques developed into the simulation with the main goal of understanding participant behavior. Novice and expert data is populated as part of the experiment to validate the effectiveness of our methods.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128014376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Platforms which combine data mining algorithms and interactive visualizations play a key role in the discovery process from complex networks data, e.g. Web and Online Social Networks data. Here we illustrate the use of Gephi, an open source software for networks visual exploration, for the visual analysis of Business Intelligence data modeled as complex networks.
{"title":"Visual Analysis of Complex Networks for Business Intelligence with Gephi","authors":"Sebastien Heymann, B. L. Grand","doi":"10.1109/IV.2013.39","DOIUrl":"https://doi.org/10.1109/IV.2013.39","url":null,"abstract":"Platforms which combine data mining algorithms and interactive visualizations play a key role in the discovery process from complex networks data, e.g. Web and Online Social Networks data. Here we illustrate the use of Gephi, an open source software for networks visual exploration, for the visual analysis of Business Intelligence data modeled as complex networks.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"61 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131555627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the study of pattern of interaction in research work (co-authorship in publications and co-partnership in research projects) using the techniques of social network analysis (SNA) and visualization. Along with computation of various network features at local and global levels to find the nature of collaboration, and important positions of researchers in collaboration network, we intersect the networks from co-authorship in publications and co-partnership in research projects with an attempt to find the important researchers, both with regard to collaboration in paper and projects. Moreover, we show the difference in nature of collaboration regarding publications and projects.
{"title":"Analysis and Visualization of Research Collaboration Pattern of an Institute through Social Network Analysis Perspective","authors":"Alok Pokharel, Hideaki Takeda","doi":"10.1109/IV.2013.33","DOIUrl":"https://doi.org/10.1109/IV.2013.33","url":null,"abstract":"This paper presents the study of pattern of interaction in research work (co-authorship in publications and co-partnership in research projects) using the techniques of social network analysis (SNA) and visualization. Along with computation of various network features at local and global levels to find the nature of collaboration, and important positions of researchers in collaboration network, we intersect the networks from co-authorship in publications and co-partnership in research projects with an attempt to find the important researchers, both with regard to collaboration in paper and projects. Moreover, we show the difference in nature of collaboration regarding publications and projects.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the age of tiles and slates, packaging information has been reduced (or expanded) to appscontained in a tile, used as an icon in a smartphone or a tablet. Regardless of the operating system, tiles seem to be the object of first eye contact, but is this the most efficient way of displaying and extracting information? If so, specify the most suitable tile layout, This paper describes the possible cluster-of-elements layouts and arrangements, it entails the goal-targeted visual processing, visual queries for extracting information simultaneously, and hence identifying the possible influences on the visual map for lexemes construct, detection and formation, ultimately making an attempt to achieve maximum number of words in the shortest possible time.
{"title":"Visual Search and Processing for Lexeme and Morpheme Constructs","authors":"Lin Hsin Hsin","doi":"10.1109/IV.2013.79","DOIUrl":"https://doi.org/10.1109/IV.2013.79","url":null,"abstract":"In the age of tiles and slates, packaging information has been reduced (or expanded) to appscontained in a tile, used as an icon in a smartphone or a tablet. Regardless of the operating system, tiles seem to be the object of first eye contact, but is this the most efficient way of displaying and extracting information? If so, specify the most suitable tile layout, This paper describes the possible cluster-of-elements layouts and arrangements, it entails the goal-targeted visual processing, visual queries for extracting information simultaneously, and hence identifying the possible influences on the visual map for lexemes construct, detection and formation, ultimately making an attempt to achieve maximum number of words in the shortest possible time.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117191122","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We introduce a matrix-based visualization technique for exploring time-varying directed and weighted graphs. Two overview representations are shown: one for the time-aggregated relations with attached quantitative weighted attributes and one for the results of an automatic dynamic pattern identification algorithm, i.e., relations accompanied by categorical attributes. Apart from a dynamic edge pattern categorization, our tool can also compute graph-specific properties---such as shortest paths or the existence of cliques---and highlight their evolution over time. The visualization method is complemented by interaction techniques that allow the user to navigate, explore, and browse the data, based on the Visual Information Seeking Mantra---overview first, zoom and filter, then details-on-demand. If an additional hierarchical organization of the vertices is available, this is attached to the matrix by vertical and horizontal layered icicle plots allowing one to explore the data on different levels of hierarchical granularity. The usefulness of the tool is demonstrated by applying it to time-varying migration data in the hierarchically structured world.
{"title":"A Matrix-Based Visualization for Exploring Dynamic Compound Digraphs","authors":"Michael Burch, Benjamin Schmidt, D. Weiskopf","doi":"10.1109/IV.2013.8","DOIUrl":"https://doi.org/10.1109/IV.2013.8","url":null,"abstract":"We introduce a matrix-based visualization technique for exploring time-varying directed and weighted graphs. Two overview representations are shown: one for the time-aggregated relations with attached quantitative weighted attributes and one for the results of an automatic dynamic pattern identification algorithm, i.e., relations accompanied by categorical attributes. Apart from a dynamic edge pattern categorization, our tool can also compute graph-specific properties---such as shortest paths or the existence of cliques---and highlight their evolution over time. The visualization method is complemented by interaction techniques that allow the user to navigate, explore, and browse the data, based on the Visual Information Seeking Mantra---overview first, zoom and filter, then details-on-demand. If an additional hierarchical organization of the vertices is available, this is attached to the matrix by vertical and horizontal layered icicle plots allowing one to explore the data on different levels of hierarchical granularity. The usefulness of the tool is demonstrated by applying it to time-varying migration data in the hierarchically structured world.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121484012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Underlying all specialized terminology is a concept system, which is particularly important in the legal domain. However, this concept system is not explicitly available in terminology management systems. We present a tool that analyzes the relations in a terminological database and presents an interactive visualization of those relations. This tool helps terminologists manage their information, including quality assurance and analysis of the information, as well as aiding in didactic presentations of terminology work.
{"title":"Visualizing Conceptual Relations in Legal Terminology","authors":"C. Culy, E. Chiocchetti, Natascia Ralli","doi":"10.1109/IV.2013.42","DOIUrl":"https://doi.org/10.1109/IV.2013.42","url":null,"abstract":"Underlying all specialized terminology is a concept system, which is particularly important in the legal domain. However, this concept system is not explicitly available in terminology management systems. We present a tool that analyzes the relations in a terminological database and presents an interactive visualization of those relations. This tool helps terminologists manage their information, including quality assurance and analysis of the information, as well as aiding in didactic presentations of terminology work.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115050777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Corinna Vehlow, Michael Burch, H. Schmauder, D. Weiskopf
We propose a novel radial layered matrix visualization for dynamic directed weighted graphs in which the vertices can also be hierarchically organized. Edges are represented as color-coded arcs within the radial diagram. Their positions are defined by polar coordinates instead of Cartesian coordinates as in traditional adjacency matrix representations: the angular position of an edge within an annulus is given by the angle bisector of the two related vertices, the radial position depends linearly on the angular distance between these vertices. The exploration of time-varying relational data is facilitated by aligning graph patterns radially. Furthermore, our approach incorporates several interaction techniques to explore dynamic patterns such as trends and countertrends. The usefulness is illustrated by two case studies analyzing large dynamic call graphs acquired from open source software projects.
{"title":"Radial Layered Matrix Visualization of Dynamic Graphs","authors":"Corinna Vehlow, Michael Burch, H. Schmauder, D. Weiskopf","doi":"10.1109/IV.2013.6","DOIUrl":"https://doi.org/10.1109/IV.2013.6","url":null,"abstract":"We propose a novel radial layered matrix visualization for dynamic directed weighted graphs in which the vertices can also be hierarchically organized. Edges are represented as color-coded arcs within the radial diagram. Their positions are defined by polar coordinates instead of Cartesian coordinates as in traditional adjacency matrix representations: the angular position of an edge within an annulus is given by the angle bisector of the two related vertices, the radial position depends linearly on the angular distance between these vertices. The exploration of time-varying relational data is facilitated by aligning graph patterns radially. Furthermore, our approach incorporates several interaction techniques to explore dynamic patterns such as trends and countertrends. The usefulness is illustrated by two case studies analyzing large dynamic call graphs acquired from open source software projects.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133418465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A new technique for approximating intersection curves of two parametric surfaces is presented, which extracts boundary points and turning points from a sequence of intersection points and interpolate them with the help of cubic spline function.
{"title":"A Novel Approach for Surface to Surface Intersection Approximation","authors":"M. Sarfraz, Misbah Irshad, F. Sarfraz, M. Hussain","doi":"10.1109/IV.2013.63","DOIUrl":"https://doi.org/10.1109/IV.2013.63","url":null,"abstract":"A new technique for approximating intersection curves of two parametric surfaces is presented, which extracts boundary points and turning points from a sequence of intersection points and interpolate them with the help of cubic spline function.","PeriodicalId":354135,"journal":{"name":"2013 17th International Conference on Information Visualisation","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123597572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}