检索结果-内蒙古大学图书馆

7th ieee symposium on Information visualization (INFOVIS 2001)

作者： Keim, DA Hao, MC Dayal, U AT&T Corp Res Florham Pk NJ USA Univ Constance D-7750 Constance Germany Hewlett Packard Res Labs Palo Alto CA USA

Simple presentation graphics are intuitive and easy-to-use, but only show highly aggregated data. Bar charts, for example, only show a rather small number of data values and x-y-plots often have a high degree of overlap. Presentation techniques are often chosen depending on the considered data type-bar charts, for example, are used for categorical data and x-y plots are used for numerical data. In this article, we propose a combination of traditional bar charts and x-y-plots, which allows the visualization of large amounts of data with categorical and numerical data. The categorical data dimensions are used for the partitioning into the bars and the numerical data dimensions are used for the ordering arrangement within the bars. The basic idea is to use the pixels within the bars to present the detailed information of the data records. Our so-called pixel bar charts retain the intuitiveness of traditional bar charts while applying the principle of x-y charts within the bars. In many applications, a natural hierarchy is defined on the categorical data dimensions such as time, region, or product type. In hierarchical pixel bar charts, the hierarchy is exploited to split the bars for selected portions of the hierarchy. Our application to a number of real-world e-business and Web services data sets shows the wide applicability and usefulness of our new idea.

关键词： information visualization multidimensional data visualization visual data exploration and data mining very large multiattributes data sets hierarchical visualization

来源：评论

学校读者我要写书评

暂无评论

Proceedings - ieee symposium on Information visualization, INFO VIS

Proceedings - IEEE Symposium on Information Visualization, I...

引用

ieee symposium on Information visualization, INFOVIS 2002

ISBN: (纸本)076951751X

The proceedings contain 23 papers. The topics discussed include: multiscale visualization using data cubes;visualization schemas for flexible information visualization;building a visual database for example-based graphics generation;efficient cartogram generation: a comparison;visualizing data with bounded uncertainty;graphical encoding for information visualization: an empirical study;the illusion of perceived metric 3D structure;process visualization with levels of detail;case study: visualizing sets of evolutionary trees;InterRing: an interactive tool for visually navigating and manipulating hierarchical structures;beamtrees: compact visualization of large hierarchies;visualizing biosequence data using texture mapping;and arc diagrams: visualizing structure in strings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Interactive visualization of unstructured grids using hierarchical 3D textures

Interactive visualization of unstructured grids using hierar...

引用

7th symposium on Volume visualization and graphics

作者： Leven, J Corso, J Cohen, J Kumar, S Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)0780376412

We present a system for interactively rendering large, unstructured grids. Our approach is to voxelize the grid into a 3D voxel octree, and then to render the data using hierarchical, 3D texture mapping. This approach leverages the current 3D texture mapping PC hardware for the problem of unstructured grid rendering. We specialize the 3D texture octree to the task of rendering unstructured grids through a novel pad and stencil algorithm, which distinguishes between data and non-data voxels. Both the voxelization and rendering processes efficiently manage large, out-of-core datasets. The system manages cache usage in main memory and texture memory, as well as bandwidths among disk, main memory, and texture memory. It also manages rendering load to achieve interactivity at all times. It maximizes a quality metric for a desired level of interactivity. It has been applied to a number of large data and produces high quality images at interactive, user-selectable frame rates using standard PC hardware.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A space-optimized tree visualization

A space-optimized tree visualization

引用

ieee symposium on Information visualization, INFOVIS 2002

作者： Nguyen, Quang Vinh Huang, Mao Lin Faculty of Information Technology University of Technology SydneyNSW2000 Australia

ISBN: (纸本)076951751X

We describe a new method for the visualization of tree structured relational data. It can be used especially for the display of very large hierarchies in a 2-dimensional space. We discuss the advantages and limitations of current techniques of tree visualization. Our strategy is to optimize the drawing of trees in a geometrical plane and maximize the utilization of display space by allowing more nodes and links to be displayed at a limit screen resolution. We use the concept of enclosure to partition the entire display space into a collection of local regions that are assigned to all nodes in tree T for the display of their sub-trees and themselves. To enable the exploration of large hierarchies, we use a modified semantic zooming technique to view the detail of a particular part of the hierarchy at a time based on user's interest. Layout animation is also provided to preserve the mental map while the user is exploring the hierarchy by changing zoomed views. © 2002 ieee.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

A hardware-assisted scalable solution for interactive volume rendering of time-varying data

A hardware-assisted scalable solution for interactive volume...

引用

7th ieee symposium on Information visualization (INFOVIS 2001)

作者： Lum, EB Ma, KL Clyne, J Univ Calif Davis CIPIC Davis CA 95616 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Natl Ctr Atmospher Res Boulder CO 80303 USA

We present a scalable volume rendering technique that exploits lossy compression and low-cost commodity hardware to permit highly interactive exploration of time-varying scalar volume data. A palette-based decoding technique and an adaptive bit allocation scheme are developed to fully utilize the texturing capability of a commodity 3D graphics card. Using a single PC equipped with a modest amount of memory, a texture capable graphics card, and an inexpensive disk array, we are able to render hundreds of time steps of regularly gridded volume data (up to 42 million voxels each time step) at interactive rates. By clustering multiple PCs together, we demonstrate the data-size scalability of our method. The frame rates achieved make possible the interactive exploration of data in the temporal, spatial, and transfer function domains. A comprehensive evaluation of our method based on experimental studies using data sets (up to 134 million voxels per time step) from turbulence flow simulations is also presented.

关键词： compression disk I/O high performance computing out-of-core processing parallel rendering PC scalable algorithms scientific visualization texture hardware time-varying data transform encoding volume rendering

来源：评论

学校读者我要写书评

暂无评论

Optimizations in the grid visualization kernel 16

Optimizations in the grid visualization kernel

引用

16th International parallel and Distributed Processing symposium, IPDPS 2002

作者： Kranzlmüller, D. Kurka, G. Heinzlreiter, P. Volkert, J. GUP Linz Joh. Kepler University Linz Altenbergerstr. 69 LinzA-4040 Austria

ISBN: (纸本)0769515738

Computational grids are large-scale computing infrastructures, which offer ubiquitous access to networked resources for integrated and collaborative use by multiple organizations. The required abstraction and management for grids is transparently performed in the grid middleware layer. An example is the Grid visualization Kernel GVK, which supports distributed near real-time interaction between distant simulation servers and visualization clients. Efficient transportation of data via limited and varying bandwidth is achieved by applying optimized abstraction and filtering techniques. The basic idea is to incorporate knowledge about visualization data structures and user viewpoints before transferring the data between server and client. Corresponding ideas include optimizations like multiple levels of detail, occlusion-culling, reference and image-based rendering. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Terrain simplification simplified: A general framework for view-dependent out-of-core visualization

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2002年第3期8卷 239-254页

作者： Lindstrom, P Pascucci, V Lawrence Livermore Natl Lab Livermore CA 94551 USA

This paper describes a general framework for out-of-core rendering and management of massive terrain surfaces. The two key components of this framework are: view-dependent refinement of the terrain mesh and a simple scheme for organizing the terrain data to improve coherence and reduce the number of paging events from external storage to main memory. Similar to several previously proposed methods for view-dependent refinement, we recursively subdivide a triangle mesh defined over regularly gridded data using longest-edge bisection. As part of this single, per-frame refinement pass, we perform triangle stripping, view frustum culling, and smooth blending of geometry using geomorphing. Meanwhile, our refinement framework supports a large class of error metrics, is highly competitive in terms of rendering performance, and is surprisingly simple to implement. Independent of our refinement algorithm, we also describe several data layout techniques for providing coherent access to the terrain data. By reordering the data in a manner that is more consistent with our recursive access pattern, we show that visualization of gigabyte-size data sets can be realized even on low-end, commodity PCs without the need for complicated and explicit data paging techniques. Rather, by virtue of dramatic improvements in multilevel cache coherence, we rely on the built-in paging mechanisms of the operating system to perform this task. The end result is a straightforward, simple-to-implement, pointerless indexing scheme that dramatically improves the data locality and paging performance over conventional matrix-based layouts.

关键词： terrain visualization surface simplification view-dependent refinement continuous levels of detail edge bisection error metrics geomorphing out-of-core algorithms external memory paging data layouts

来源：评论

学校读者我要写书评

暂无评论

Hardware-Accelerated parallel Non-Photorealistic Volume Rendering 02

Hardware-Accelerated Parallel Non-Photorealistic Volume Rend...

引用

NPAR 2002 symposium on Non-Photorealistic Animation and Rendering

作者： Lum, Eric B. Ma, Kwan-Liu University of California Davis United States Department of Computer Science University of California One Shields Avenue Davis 95616 United States

ISBN: (纸本)9781581134940

Non-photorealistic rendering can be used to illustrate subtle spatial relationships that might not be visible with more realistic rendering techniques. We present a parallel hardware-accelerated rendering technique, making extensive use of multi-texturing and paletted textures, for the interactive non-photorealistic visualization of scalar volume data. With this technique, we can render a 512×512×512 volume using non-photorealistic techniques that include tone-shading, silhouettes, gradient-based enhancement, and color depth cueing, as shown in the images on the color plate, at multiple frames second. The interactivity we achieve with our method allows for the exploration of a large visualization parameter space for the creation of effective illustrations.

关键词： Interactive computer graphics

来源：评论

学校读者我要写书评

暂无评论

Terrain simplification simplified: A general framework for view-dependent out-of-core visualization

Terrain simplification simplified: A general framework for v...

引用

7th ieee symposium on Information visualization (INFOVIS 2001)

作者： Lindstrom, P Pascucci, V Lawrence Livermore Natl Lab Livermore CA 94551 USA

来源：评论

学校读者我要写书评

暂无评论

Enhancing data migration performance via parallel data compression 16

Enhancing data migration performance via parallel data compr...

引用

16th International parallel and Distributed Processing symposium, IPDPS 2002

作者： Lee, Jonghyun Winslett, M. Ma, Xiaosong Yu, Shengke Department of Computer Science University of Illinois UrbanaIL61801 United States

ISBN: (纸本)0769515738

Scientific simulations often produce large volumes of output that are moved to another platform for visualization or storage. This long-distance migration is slow due to the data size and slow network. Compression can improve migration performance by reducing the data size, but compression is computation-intensive and so can raise costs. In this work, we show how to reduce data migration cost by incorporating compression into migration. We analyze eight scientific data sets, and propose three approaches for parallel compression of scientific data. Our results show that with reasonably fast processors and typical parallel configurations, the compression cost for large scientific data is outweighed by the performance gain obtained by migrating less data. We found that a client-side compression approach (CC) can improve I/O and migration performance by an order of magnitude. In our experiments, CC always matches or outperforms migration without compression when we overlap migration with computation, even for not very compressible dense floating point data. We also present a variant of CC that is well suited for use with implementations of two-phase I/O. © 2002 ieee.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：