Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475453
Jean-François El Hajjar, Stéphane Marchesin, J. Dischler, C. Mongenet
In the field of Volume Rendering, the pre-integration of arbitrary transfer functions has certainly led to the most significant and convincing results both quality and performance wise, allowing high quality visualization on standard PC consumer graphics. By showing that the ideal scalar signal along the cast rays is better approximated by a succession of polynomial curves as opposed to linear segments, we propose a new method for pre-integrated volume rendering. This method is based on a second order polynomial interpolation of the scalar values, allowing it to converge more rapidly towards the integration of a volume reconstructed by a trilinear filter. This approach manages to capture the smoothness of the volume's details without the need of further ray resampling, and consequently succeeds in reducing the visual artefacts in comparison to previous techniques. Furthermore, we adapt an existing technique to compute our pre-integration tables using the GPU, thus making our approach suitable for transfer function manipulations.
{"title":"Second Order Pre-Integrated Volume Rendering","authors":"Jean-François El Hajjar, Stéphane Marchesin, J. Dischler, C. Mongenet","doi":"10.1109/PACIFICVIS.2008.4475453","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475453","url":null,"abstract":"In the field of Volume Rendering, the pre-integration of arbitrary transfer functions has certainly led to the most significant and convincing results both quality and performance wise, allowing high quality visualization on standard PC consumer graphics. By showing that the ideal scalar signal along the cast rays is better approximated by a succession of polynomial curves as opposed to linear segments, we propose a new method for pre-integrated volume rendering. This method is based on a second order polynomial interpolation of the scalar values, allowing it to converge more rapidly towards the integration of a volume reconstructed by a trilinear filter. This approach manages to capture the smoothness of the volume's details without the need of further ray resampling, and consequently succeeds in reducing the visual artefacts in comparison to previous techniques. Furthermore, we adapt an existing technique to compute our pre-integration tables using the GPU, thus making our approach suitable for transfer function manipulations.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130251027","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475464
A. J. Pretorius, J. van Wijk
We present a new method for the visual analysis of multivariate system traces. Our method combines three perspectives: (1) a schematic diagram, (2) time series plots and (3) a state transition graph. After we show how these perspectives are related, we discuss their integration into a single solution for the visual analysis of multivariate system traces. The combination of the three perspectives provides the user with a rich analysis interface that enables gaining significant insight into system behavior. We illustrate some of the advantages of our approach by providing a real-world use case.
{"title":"Multiple Views on System Traces","authors":"A. J. Pretorius, J. van Wijk","doi":"10.1109/PACIFICVIS.2008.4475464","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475464","url":null,"abstract":"We present a new method for the visual analysis of multivariate system traces. Our method combines three perspectives: (1) a schematic diagram, (2) time series plots and (3) a state transition graph. After we show how these perspectives are related, we discuss their integration into a single solution for the visual analysis of multivariate system traces. The combination of the three perspectives provides the user with a rich analysis interface that enables gaining significant insight into system behavior. We illustrate some of the advantages of our approach by providing a real-world use case.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132792745","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475457
Weidong Huang, Seok-Hee Hong, P. Eades
In visualizing graphs as node-link diagrams, it is commonly accepted and employed as a general rule that the number of link crossings should be minimized whenever possible. However, little attention has been paid to how to handle the remaining crossings in the visualization. The study presented in this paper examines the effects of crossing angles on performance of path tracing tasks. It was found that the effect varied with the size of crossing angles. In particular, task response time decreased as the crossing angle increased. However, the rate of the decrease tended to level off when the angle was close to 90 degrees. One of the implications of this study in graph visualization is that just minimizing the crossing number is not sufficient to reduce the negative impact to the minimum. The angles of remaining crossings should be maximized as well.
{"title":"Effects of Crossing Angles","authors":"Weidong Huang, Seok-Hee Hong, P. Eades","doi":"10.1109/PACIFICVIS.2008.4475457","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475457","url":null,"abstract":"In visualizing graphs as node-link diagrams, it is commonly accepted and employed as a general rule that the number of link crossings should be minimized whenever possible. However, little attention has been paid to how to handle the remaining crossings in the visualization. The study presented in this paper examines the effects of crossing angles on performance of path tracing tasks. It was found that the effect varied with the size of crossing angles. In particular, task response time decreased as the crossing angle increased. However, the rate of the decrease tended to level off when the angle was close to 90 degrees. One of the implications of this study in graph visualization is that just minimizing the crossing number is not sufficient to reduce the negative impact to the minimum. The angles of remaining crossings should be maximized as well.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130717687","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475462
Liya Li, Hsien-Hsi Hsieh, Han-Wei Shen
Inspired by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative streamlines in 2D vector fields to enforce visual clarity and evidence. A particular focus of our algorithm is to depict the underlying flow patterns effectively and succinctly with a minimum set of streamlines. To achieve this goal, 2D distance fields are generated to encode the distances from each grid point in the field to the nearby streamlines. A local metric is derived to measure the dissimilarity between the vectors from the original field and an approximate field computed from the distance fields. A global metric is used to measure the dissimilarity between streamlines based on the local errors to decide whether to drop a new seed at a local point. This process is iterated to generate streamlines until no more streamlines can be found that are dissimilar to the existing ones. We present examples of images generated from our algorithm and report results from qualitative analysis and user studies.
{"title":"Illustrative Streamline Placement and Visualization","authors":"Liya Li, Hsien-Hsi Hsieh, Han-Wei Shen","doi":"10.1109/PACIFICVIS.2008.4475462","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475462","url":null,"abstract":"Inspired by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative streamlines in 2D vector fields to enforce visual clarity and evidence. A particular focus of our algorithm is to depict the underlying flow patterns effectively and succinctly with a minimum set of streamlines. To achieve this goal, 2D distance fields are generated to encode the distances from each grid point in the field to the nearby streamlines. A local metric is derived to measure the dissimilarity between the vectors from the original field and an approximate field computed from the distance fields. A global metric is used to measure the dissimilarity between streamlines based on the local errors to decide whether to drop a new seed at a local point. This process is iterated to generate streamlines until no more streamlines can be found that are dissimilar to the existing ones. We present examples of images generated from our algorithm and report results from qualitative analysis and user studies.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122793719","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 present a new framework that combines the hierarchical multi-resolution representation with video-based compression to manage and render large scale time-varying data. In the preprocessing step, the proposed method first constructs a multi-resolution hierarchy using octree structure for each individual time step, and then applies a motion-compensation-based prediction to compress the octree nodes. During rendering stage, the data is decompressed on-the-fly and rendered using hardware texture mapping. The proposed approach eliminates the hierarchical decompression dependency commonly found in the conventional hierarchical wavelet representation methods, which leads to a more efficient reconstruction of data along the time axis. The system provides the user with a spatial region-of-interest (ROI) to adjust the spatial level-of-detail (LOD) selection, and a temporal ROI which is a sub-region only for frequent update during playback. With a suitable control of both ROIs, our system can reach an interactive playback frame rate. This allows the user to observe the dynamic nature of large time-varying data sets.
{"title":"Multi-resolution Volume Rendering of Large Time-Varying Data using Video-based Compression","authors":"Chia-Lin Ko, Horng-Shyang Liao, Tsaipei Wang, Kuang-Wei Fu, Ching-Yao Lin, Jung-Hong Chuang","doi":"10.1109/PACIFICVIS.2008.4475469","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475469","url":null,"abstract":"We present a new framework that combines the hierarchical multi-resolution representation with video-based compression to manage and render large scale time-varying data. In the preprocessing step, the proposed method first constructs a multi-resolution hierarchy using octree structure for each individual time step, and then applies a motion-compensation-based prediction to compress the octree nodes. During rendering stage, the data is decompressed on-the-fly and rendered using hardware texture mapping. The proposed approach eliminates the hierarchical decompression dependency commonly found in the conventional hierarchical wavelet representation methods, which leads to a more efficient reconstruction of data along the time axis. The system provides the user with a spatial region-of-interest (ROI) to adjust the spatial level-of-detail (LOD) selection, and a temporal ROI which is a sub-region only for frequent update during playback. With a suitable control of both ROIs, our system can reach an interactive playback frame rate. This allows the user to observe the dynamic nature of large time-varying data sets.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121781173","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475455
Guangfeng Ji, Han-Wei Shen, Jinzhu Gao
We present a non-photo realistic rendering technique for interactive exploration of isosurfaces generated from remote volumetric data. Instead of relying on the conventional smooth shading technique to render the isosurfaces, a point-based technique is used to represent and render the isosurfaces in a remote client-server environment. The non-photo realistic nature of the proposed rendering method enables the server to transmit only the essential surface features, which substantially reduces the network traffic. The algorithm also utilizes frame coherence and efficiently encodes the isosurface configuration inside each voxel cell to further minimize the network overhead. Finally, our algorithm can adjust the point distributions using different illumination settings to adapt to different network speeds.
{"title":"Interactive Exploration of Remote Isosurfaces with Point-Based Non-Photorealistic Rendering","authors":"Guangfeng Ji, Han-Wei Shen, Jinzhu Gao","doi":"10.1109/PACIFICVIS.2008.4475455","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475455","url":null,"abstract":"We present a non-photo realistic rendering technique for interactive exploration of isosurfaces generated from remote volumetric data. Instead of relying on the conventional smooth shading technique to render the isosurfaces, a point-based technique is used to represent and render the isosurfaces in a remote client-server environment. The non-photo realistic nature of the proposed rendering method enables the server to transmit only the essential surface features, which substantially reduces the network traffic. The algorithm also utilizes frame coherence and efficiently encodes the isosurface configuration inside each voxel cell to further minimize the network overhead. Finally, our algorithm can adjust the point distributions using different illumination settings to adapt to different network speeds.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132220350","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475474
Zeqian Shen, K. Ma
The widespread use of mobile devices brings opportunities to capture large-scale, continuous information about human behavior. Mobile data has tremendous value, leading to business opportunities, market strategies, security concerns, etc. Visual analytics systems that support interactive exploration and discovery are needed to extracting insight from the data. However, visual analysis of complex social-spatial-temporal mobile data presents several challenges. We have created MobiVis, a visual analytics tool, which incorporates the idea of presenting social and spatial information in one heterogeneous network. The system supports temporal and semantic filtering through an interactive time chart and ontology graph, respectively, such that data subsets of interest can be isolated for close-up investigation. "Behavior rings," a compact radial representation of individual and group behaviors, is introduced to allow easy comparison of behavior patterns. We demonstrate the capability of MobiVis with the results obtained from analyzing the MIT Reality Mining dataset.
{"title":"MobiVis: A Visualization System for Exploring Mobile Data","authors":"Zeqian Shen, K. Ma","doi":"10.1109/PACIFICVIS.2008.4475474","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475474","url":null,"abstract":"The widespread use of mobile devices brings opportunities to capture large-scale, continuous information about human behavior. Mobile data has tremendous value, leading to business opportunities, market strategies, security concerns, etc. Visual analytics systems that support interactive exploration and discovery are needed to extracting insight from the data. However, visual analysis of complex social-spatial-temporal mobile data presents several challenges. We have created MobiVis, a visual analytics tool, which incorporates the idea of presenting social and spatial information in one heterogeneous network. The system supports temporal and semantic filtering through an interactive time chart and ontology graph, respectively, such that data subsets of interest can be isolated for close-up investigation. \"Behavior rings,\" a compact radial representation of individual and group behaviors, is introduced to allow easy comparison of behavior patterns. We demonstrate the capability of MobiVis with the results obtained from analyzing the MIT Reality Mining dataset.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133232306","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475461
K. Bürger, P. Kondratieva, J. Krüger, R. Westermann
Particle tracing has been established as a powerful visualization technique to show the dynamics of 3D flows. Particle tracing in 3D, however, quickly overextends the viewer due to the massive amount of visual information that is typically produced by this technique. In this paper, we present strategies to reduce this amount at the same time revealing important structures in the flow. As an importance measure, we introduce a simple, yet effective clustering approach for vector fields, and we use scalar flow quantities at different scales in combination with user-defined regions of interest. These measures are used to control the shape, the appearance, and the density of particles in such a way that the user can focus on the dynamics in important regions at the same time preserving context information. We also introduce a new focus for particle tracing, so called anchor lines. Anchor lines are used to analyze local flow features by visualizing how much particles separate over time and how long it takes until they have separated to a fixed distance. It is of particular interest if the finite time Lyapunov exponent - a scalar quantity that measures the rate of separation of infinitesimally close particles in the flow - is used to guide the placement of anchor lines. The effectiveness of our approaches for the visualization of 3D flow fields is validated using synthetic fields as well as real simulation data.
{"title":"Importance-Driven Particle Techniques for Flow Visualization","authors":"K. Bürger, P. Kondratieva, J. Krüger, R. Westermann","doi":"10.1109/PACIFICVIS.2008.4475461","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475461","url":null,"abstract":"Particle tracing has been established as a powerful visualization technique to show the dynamics of 3D flows. Particle tracing in 3D, however, quickly overextends the viewer due to the massive amount of visual information that is typically produced by this technique. In this paper, we present strategies to reduce this amount at the same time revealing important structures in the flow. As an importance measure, we introduce a simple, yet effective clustering approach for vector fields, and we use scalar flow quantities at different scales in combination with user-defined regions of interest. These measures are used to control the shape, the appearance, and the density of particles in such a way that the user can focus on the dynamics in important regions at the same time preserving context information. We also introduce a new focus for particle tracing, so called anchor lines. Anchor lines are used to analyze local flow features by visualizing how much particles separate over time and how long it takes until they have separated to a fixed distance. It is of particular interest if the finite time Lyapunov exponent - a scalar quantity that measures the rate of separation of infinitesimally close particles in the flow - is used to guide the placement of anchor lines. The effectiveness of our approaches for the visualization of 3D flow fields is validated using synthetic fields as well as real simulation data.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133511333","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475454
F. Rößler, R. Botchen, T. Ertl
Volume rendering of multiple intersecting volumetric objects is a difficult visualization task, especially if different rendering styles need to be applied to the components, in order to achieve the desired illustration effect. Real-time performance for even complex scenarios is obtained by exploiting the speed and flexibility of modern GPUs, but at the same time programming the necessary shaders turned into a task for GPU experts only. We foresee the demand for an intermediate level of programming abstraction where visualization specialists can realize advanced applications without the need to deal with shader programming intricacies. In this paper, we describe a generic technique for multi-volume rendering, which generates shader code dynamically from an abstract render graph. By combining pre-defined nodes, complex volume operations can be realized. Our system efficiently creates GPU-based fragment shader and vertex shader programs "on-the-fly" to achieve the desired visual results. We demonstrate the flexibility of our technique by applying several dynamically generated volume rendering styles to multi-modal medical datasets.
{"title":"Dynamic Shader Generation for Flexible Multi-Volume Visualization","authors":"F. Rößler, R. Botchen, T. Ertl","doi":"10.1109/PACIFICVIS.2008.4475454","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475454","url":null,"abstract":"Volume rendering of multiple intersecting volumetric objects is a difficult visualization task, especially if different rendering styles need to be applied to the components, in order to achieve the desired illustration effect. Real-time performance for even complex scenarios is obtained by exploiting the speed and flexibility of modern GPUs, but at the same time programming the necessary shaders turned into a task for GPU experts only. We foresee the demand for an intermediate level of programming abstraction where visualization specialists can realize advanced applications without the need to deal with shader programming intricacies. In this paper, we describe a generic technique for multi-volume rendering, which generates shader code dynamically from an abstract render graph. By combining pre-defined nodes, complex volume operations can be realized. Our system efficiently creates GPU-based fragment shader and vertex shader programs \"on-the-fly\" to achieve the desired visual results. We demonstrate the flexibility of our technique by applying several dynamically generated volume rendering styles to multi-modal medical datasets.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122832017","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}
Pub Date : 2008-03-05DOI: 10.1109/PACIFICVIS.2008.4475472
James Shearer, Michael Ogawa, K. Ma, Toby Kohlenberg
Animation is frequently utilized to visually depict change in time- varying data sets. For this task, it is a natural fit. Yet explicit animation is rarely employed for static data. We discuss the use of animation to overcome three common limitations faced by information visualization applications in the context of small-display devices: constraints on the output display, limited interaction possibilities, and high data density. We provide concrete examples of applying animation to combat such limitations for four common visualization types: geospatial data, treemaps, parallel coordinate displays, and large graphs. Unlike previous work which examines animation for maintaining user orientation during view changes or for displaying data variables, we discuss animation's utility for multiplexing available screen space. In the context of constrained displays, we demonstrate its ability to effectively gain screen resolution, to quickly uncover trends, to help find unexpected data patterns, and to reduce visual clutter.
{"title":"Pixelplexing: Gaining Display Resolution Through Time","authors":"James Shearer, Michael Ogawa, K. Ma, Toby Kohlenberg","doi":"10.1109/PACIFICVIS.2008.4475472","DOIUrl":"https://doi.org/10.1109/PACIFICVIS.2008.4475472","url":null,"abstract":"Animation is frequently utilized to visually depict change in time- varying data sets. For this task, it is a natural fit. Yet explicit animation is rarely employed for static data. We discuss the use of animation to overcome three common limitations faced by information visualization applications in the context of small-display devices: constraints on the output display, limited interaction possibilities, and high data density. We provide concrete examples of applying animation to combat such limitations for four common visualization types: geospatial data, treemaps, parallel coordinate displays, and large graphs. Unlike previous work which examines animation for maintaining user orientation during view changes or for displaying data variables, we discuss animation's utility for multiplexing available screen space. In the context of constrained displays, we demonstrate its ability to effectively gain screen resolution, to quickly uncover trends, to help find unexpected data patterns, and to reduce visual clutter.","PeriodicalId":364669,"journal":{"name":"2008 IEEE Pacific Visualization Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129087822","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：