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

ieee symposium on parallel and large-data visualization and graphics

作者： Samanta, R Funkhouser, T Li, K Princeton Univ Princeton NJ 08540 USA

ISBN: (纸本)0780372239

With the recent advances in commodity graphics hardware performance, PC clusters have become an attractive alternative to traditional high-end graphics workstations. The main challenge is to develop parallel rendering algorithms that work well within the memory constraints and communication limitations of a networked cluster. Previous systems have required the entire 3D scene to be replicated in memory on every PC. While this approach can take advantage of view-dependent load balancing algorithms and thus largely avoid the problems of inter-process communication, it limits the scalability of the system to the memory capacity of a single PC. We present a k-way replication approach in which each 3D primitive of a large scene is replicated on k out of n PCs (k much less than n). The key idea is to support 3D models larger than the memory capacity of any single PC, while retaining the reduced communication overheads of dynamic view-dependent partitioning. In this paper, we investigate algorithms for distributing copies of primitives among PCs and for dynamic load balancing under the constraints of partial replication. Our main result is that the parallel rendering efficiencies achieved with small replication factors are similar to the ones measured with full replication. By storing one-fourth of Michelangelo's David model (800MB) on each of 24 PCs (each with 256MB of memory), our system is able to render 40 million polygons/second (65% efficiency).

关键词： parallel rendering interactive visualization cluster computing computer graphics systems

来源：评论

学校读者我要写书评

暂无评论

visualization challenges for a new cyberpharmaceutical computing paradigm

Visualization challenges for a new cyberpharmaceutical compu...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Turner, RJ Chaturvedi, K Edwards, NJ Fasulo, D Halpern, AL Huson, DH Kohlbacher, O Miller, JR Reinert, K Remington, KA Schwartz, R Walenz, B Yooseph, S Istrail, S Celera Genom Corp Rockville MD 20850 USA

ISBN: (纸本)0780372239

In recent years, an explosion in data has been profoundly changing the field of biology and creating the need for new areas of expertise, particularly in the handling of data. One vital area that has so far received insufficient attention is how to communicate the large quantities of diverse and complex information that is being generated. Celera has encountered a number of visualization problems in the course of developing tools for bioinformatics research, applying them to our data generation efforts, and making that data available to our customers. This paper presents several examples from Celera's experience. In the area of genomics, challenging visualization problems have come up in assembling genomes, studying variations between individuals, and comparing different genomes to one another. The emerging area of proteomics has created new visualization challenges in interpreting protein expression data, studying protein regulatory networks, and examining protein structure. These examples illustrate how the field of bioinformatics is posing new challenges concerning the communication of data that are often very different from those that have heretofore dominated scientific computing. Addressing the level of detail, the degree of complexity, and the interdisciplinary barriers that characterize bioinformatic problems can be expected to be a sizable but rewarding task for the field of scientific visualization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel view-dependent isosurface extraction using multi-pass occlusion culling

Parallel view-dependent isosurface extraction using multi-pa...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Gao, JZ Shen, HW Ohio State Univ Dept Comp & Informat Sci Columbus OH 43210 USA

ISBN: (纸本)0780372239

This paper presents a parallel algorithm that can effectively extracts only the visible portion of isosurfaces. The main focus of our research is to devise a load-balanced and output-sensitive algorithm, that is, each processor will generate approximately the same amount of triangles, and cells that do not contain the visible isosurface will not be visited. A novel multi-pass algorithm is proposed in the paper to achieve these goals. In the algorithm, we first use an octree data structure to rapidly skip the empty cells. An image space visibility culling technique is then used to identify the visible isosurface cells in a progressive manner. To distribute the workload, we use a binary image space partitioning method to ensure that each processor will generate approximately the same amount of triangles. Isosurface extraction and visibility update are performed in parallel to reduce the total computation time. In addition to reducing the size of output geometry and accelerating the process of isosurface extraction, the multi-pass nature of our algorithm can also be used to perform time-critical computation.

关键词： view-dependent occlusion culling isosurface extraction multi-pass algorithm hierarchical data structures

来源：评论

学校读者我要写书评

暂无评论

Scalable interactive volume rendering using off-the-shelf components

Scalable interactive volume rendering using off-the-shelf co...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Lombeyda, S Moll, L Shand, M Breen, D Heirich, A CALTECH Pasadena CA 91125 USA

ISBN: (纸本)0780372239

This paper describes an application of a second generation implementation of the Sepia architecture (Sepia-2) to interactive volumetric visualization of large rectilinear scalar fields. By employing pipelined associative blending operators in a sort-last configuration a demonstration system with 8 rendering computers sustains 24 to 28 frames per second while interactively rendering large data volumes (1024x256x256 voxels, and 512x512x512 voxels). We believe interactive performance at these frame rates and data sizes is unprecedented. We also believe these results can be extended to other types of structured and unstructured grids and a variety of GL rendering techniques including surface rendering and shadow mapping. We show how to extend our single-stage crossbar demonstration system to multi-stage networks in order to support much larger data sizes and higher image resolutions. This requires solving a dynamic mapping problem for a class of blending operators that includes Porter-Duff compositing operators.

关键词： sort-last parallel cluster shear-warp volume rendering ray-casting shadow mapping CFD VolumePro OpenGL VIA Clos

来源：评论

学校读者我要写书评

暂无评论

A unified infrastructure for parallel out-of-core isosurface extraction and volume rendering of unstructured grids

A unified infrastructure for parallel out-of-core isosurface...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Chiang, YJ Farias, R Silva, CT Wei, B Polytech Univ Dept Comp & Informat Sci Brooklyn NY 11201 USA

ISBN: (纸本)0780372239

In this paper, we present a unified infrastructure for parallel out-of-ore isosurface extraction and volume rendering of large unstructured grids on distributed-memory parallel machines. We parallelize the out-of-core isosurface extraction algorithm of [9] and the out-of-core ZSweep technique [17] for direct volume rendering, using the meta-cell technique as a unified underlying building block. Our one-time preprocessing first partitions the dataset into meta-ells that are stored in disk. From the meta-cells, we build a BBIO tree in disk, which can be used to speed up isosurface extraction, and a bounding-box file in disk, which is used for direct volume rendering. At run-time, we use a simple self-scheduling scheme [39] to achieve load balancing among the processors, We perform several experiments on a sixteen-node cluster of PCs connected by a gigabit ethernet, using datasets as large as 6.6 million cells. For the larger datasets, we have found that both our isosurface extraction and direct volume rendering approaches are perfectly scalable up to sixteen nodes.

关键词： isosurface extraction volume rendering parallel computation out-of-core techniques scientific visualization

来源：评论

学校读者我要写书评

暂无评论

Real-time out-of-core visualization of particle traces

Real-time out-of-core visualization of particle traces

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Bruckschen, R Kuester, F Hamann, B Joy, KI Univ Calif Davis Ctr Image Proc & Integrated Computing Visualizat & Graph Res Grp Dept Comp Sci Davis CA 95616 USA

ISBN: (纸本)0780372239

visualization of particle traces provides intuitive and efficient means for the exploration and analysis of complex vector fields. This paper presents a method suitable for the real-time visualization of arbitrarily large time-varying vector fields in virtual environments. We describe an out-of-core scheme in which two distinct pre-processing and rendering components enable real-time data streaming and visualization. The presented approach yields low-latency application start-up times and small memory footprints. The described system was used to implement a "volumetric fog lance," which can emit up to 60000 particles into a flow field while maintaining an interactive frame rate of 60 frames per second. All algorithms were specifically designed to support commodity hardware. The proof-of-concept system is running on a low-cost Linux workstation equipped with a 120GB E-IDE RAID (Redundant Array of Inexpensive! Disk) system.

关键词： particle tracing scientific visualization computational fluid dynamics out-of-core visualization virtual reality

来源：评论

学校读者我要写书评

暂无评论

visualization of large data sets with the active data repository

引用

ieee COMPUTER graphics AND APPLICATIONS 2001年第4期21卷 24-33页

作者： Kurc, T Çatalyürek, Ü Chang, CL Sussman, A Saltz, J Johns Hopkins Med Inst Dept Pathol Baltimore MD 21287 USA Johns Hopkins Sch Med Dept Pathol Baltimore MD USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA

We implement ray-casting-based volume rendering and isosurface rendering methods using the Active data Repository (ADR) for visualizing out-of-core data sets.

关键词： data visualization Memory management parallel machines Isosurfaces Information retrieval Runtime Indexing data mining Partitioning algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Reducing latency to volume visualization on PC cluster

Reducing latency to volume visualization on PC cluster

引用

14th Brazilian symposium on Computer graphics and Image Processing

作者： Bressan, PA Zuffo, MK Univ Sao Paulo Polytech Sch Lab Integrated Syst EPUSP Sao Paulo Brazil

ISBN: (纸本)0769513301

Volume visualization is an important tool in many scientific applications, requiring intensive processing and dealing with large amounts of data. Therefore the size of these data always exceeds the processing and visualization capacities of the conventional workstations. In this technical poster we present our working in progress about techniques of data prefetching and data prediction to volume visualization on low cost PC clusters. Our approach is based on the Distributed Shared Memory (DSM) paradigm [3], which one can greatly facilitate the parallel programming efforts on volume visualization applications.

关键词： parallel volume visualization PC cluster DSM data prefetching data prediction

来源：评论

学校读者我要写书评

暂无评论

proceedings: ieee symposium on Information visualization 2001

Proceedings: IEEE Symposium on Information Visualization 200...

引用

ieee symposium on Information visualization 2001 (INFOVIS)

The proceedings contains 22 papers. Topics discussed include time,change and clustering, software testing and focus zooming, graph visualization, hierarchical visualization, blurring, queries and bar charts, decision ... 详细信息

关键词： data processing

来源：评论

学校读者我要写书评

暂无评论

Case study: visualization for decision tree analysis in data mining

Case study: Visualization for decision tree analysis in data...

引用

7th ieee symposium on Information visualization (INFOVIS 2001)

作者： Barlow, T Neville, P

ISBN: (纸本)0769513425

Decision trees are one of the most popular methods of data mining. Decision trees partition large amounts of data into smaller segments by applying a series of rules. Creating and evaluating decision trees benefits greatly from visualization of the trees and diagnostic measures of their effectiveness. This paper describes an application, EMTree Results Viewer, that supports decision tree analysis through the visualization of model results and diagnosis. The functionality of the application and the visualization techniques are revealed through an example of churn analysis in the telecommunications industry.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：