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

ieee symposium on parallel and large-data visualization and graphics

作者： Brodsky, D Pedersen, JB Univ British Columbia Dept Comp Sci Vancouver BC V6T 1W5 Canada

ISBN: (纸本)078038122X

As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity workstations, a viable approach to simplifying such models is parallel mesh simplification algorithms. A naive approach that divides the model into a number of equally sized chunks and distributes them to a number of potentially heterogeneous workstations is bound to fail. In severe cases the computation becomes virtually impossible due to significant slow downs because of memory thrashing. We present a general parallel framework for simplification of very large meshes. This framework ensures a near optimal utilization of the computational resources in a cluster of workstations by providing an intelligent partitioning of the model. This partitioning ensures a high quality output, low runtime due to intelligent load balancing, and high parallel efficiency by providing total memory utilization of each machine, thus guaranteeing not to trash the virtual memory system. To test the usability of our framework we have implemented a parallel version of R-Simp [Brodsky and Watson 2000].

关键词： Workstations Computer science Computational intelligence Machine intelligence Usability Partitioning algorithms Educational institutions Runtime Load management Testing

来源：评论

学校读者我要写书评

暂无评论

Illustrative interactive stipple rendering

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2003年第2期9卷 127-138页

作者： Lu, AD Morris, CJ Taylor, J Ebert, DS Hansen, C Rheingans, P Hartner, M Purdue Univ Rendering & Perceptualizat Lab W Lafayette IN 47907 USA IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA Univ Utah Sch Comp Sci Comp & Image Inst Salt Lake City UT 84112 USA Univ Maryland Baltimore Cty Dept Comp Sci & Elect Engn Baltimore MD USA

Simulating hand-drawn illustration can succinctly express information in a manner that is communicative and informative. We present a framework for an interactive direct stipple rendering of volume and surface-based objects. By combining the principles of artistic and scientific illustration, we explore several feature enhancement techniques to create effective, interactive visualizations of scientific and medical data sets. We also introduce a rendering mechanism that generates appropriate point lists at all resolutions during an automatic preprocess and modifies rendering styles through different combinations of these feature enhancements. The new system is an effective way to interactively preview large, complex volume and surface data sets in a concise, meaningful, and illustrative manner. Stippling is effective for many applications and provides a quick and efficient method to investigate both volume and surface models.

关键词： nonphotorealistic rendering volume rendering scientific visualization medical imaging illustration stippling

来源：评论

学校读者我要写书评

暂无评论

parallel cell projection rendering of adaptive mesh refinement data 03

Parallel cell projection rendering of adaptive mesh refineme...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Weber, GH Öhler, M Kreylos, O Shalf, JM Bethel, EW Hamann, B Scheuermann, G Univ Calif Davis Dept Comp Sci CIPIC Davis CA 95616 USA

ISBN: (纸本)078038122X

Adaptive Mesh Refinement (AMR) is a technique used in numerical simulations to automatically refine (or de-refine) certain regions of the physical domain in a finite difference calculation. AMR data consists of nested hierarchies of data grids. As AMR visualization is still a relatively unexplored topic, our work is motivated by the need to perform efficient visualization of large AMR data sets. We present a software algorithm for parallel direct volume rendering of AMR data using a cell-projection technique on several different parallel platforms. Our algorithm can use one of several different distribution methods, and we present performance results for each of these alternative approaches. By partitioning an AMR data set into blocks of constant resolution and estimating rendering costs of individual blocks using an application specific benchmark, it is possible to achieve even load balancing.

关键词： volume rendering adaptive mesh refinement load balancing. multi-arid methods parallel rendering visualization

来源：评论

学校读者我要写书评

暂无评论

From cluster to wall with VTK 03

From cluster to wall with VTK

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Moreland, K Thompson, D Sandia Natl Labs Livermore CA 94550 USA

ISBN: (纸本)078038122X

This paper describes a new set of parallel rendering components for VTK, the visualization Toolkit. The parallel rendering units allow for the rendering of vast quantities of geometry with a focus on cluster computers. Furthermore, the geometry may be displayed on tiled displays at full or reduced resolution. We demonstrate an interactive VTK application processing an isosurface consisting of nearly half a billion triangles and displaying on a power wall with a total resolution of 63 million pixels. We also demonstrate an interactive VTK application displaying the same geometry on a desktop connected to the cluster via a TCP/IP socket over 100BASE-T Ethernet.

关键词： parallel rendering desktop delivery tile display PC cluster Chromium VTK

来源：评论

学校读者我要写书评

暂无评论

visualization of large-scale customer satisfaction surveys using a parallel coordinate tree

Visualization of large-scale customer satisfaction surveys u...

引用

9th Annual ieee symposium on Information visualization (INFOVIS 2003)

作者： Brodbeck, D Girardin, L Macrofocus GmbH Germany

ISBN: (纸本)0780381548

Satisfaction surveys are an important measurement tool in fields such as market research or human resources management. Serious studies consist of numerous questions and contain answers from large population samples. Aggregation on both sides, the questions asked as well as the answers received, turns the multidimensional problem into a complex system of interleaved hierarchies. Traditional ways of presenting the results are limited to one-dimensional charts and cross-tables. We developed a visualization method called the parallel Coordinate Tree that combines multidimensional analysis with a tree structure representation. Distortion-oriented focus+context techniques are used to facilitate interaction with the visualization. In this paper we present a design study of a commercial application that we built, using this method to analyze and communicate results from large-scale customer satisfaction surveys.

关键词： parallel coordinates focus plus context hierarchical data satisfaction survey

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel out-of-core isosurface extraction 03

Efficient parallel out-of-core isosurface extraction

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Zhang, HJ Newman, TS Univ Alabama Dept Comp Sci Huntsville AL 35899 USA

ISBN: (纸本)078038122X

A new approach for large dataset isosurface extraction is presented. The approach's aim is efficient parallel isosurfacing when the dataset cannot be processed entirely in-core. The approach focuses on reducing the memory requirement and optimizing disk I/O while achieving a balanced load. In particular, an accurate model of isosurface extraction time is exploited to evenly distribute work across processors. The approach achieves processing efficiency by also avoiding unnecessary processing for portions of the dataset that are not intersected by the isosurface. To reduce the redundant computations and the storage requirements, a flexible, variably-granular data structure is utilized, thereby achieving excellent time and space performance.

关键词： isosurface extraction load balancing out-of-core parallel processing

来源：评论

学校读者我要写书评

暂无评论

The feature tree: Visualizing feature tracking in distributed AMR datasets 03

The feature tree: Visualizing feature tracking in distribute...

引用

ieee symposium on parallel and large-data visualization and graphics

作者： Chen, J Silver, D Jiang, L Rutgers State Univ Dept Elect & Comp Engn Piscataway NJ 08855 USA

ISBN: (纸本)078038122X

In this paper, we describe a feature extraction and tracking algorithm for AMR (Adaptive Mesh Refinement) datasets that operates within a distributed computing environment. Because features can span multiple refinement levels and multiple processors, tracking must be performed across time, across levels, and across processors. The resulting visualization is represented as a "Feature Tree". A feature will now contain multiple parts corresponding to different levels of refinements. The feature tree allows a viewer to determine that a feature splits or merges at the next refinement level, and allows a viewer to extract and isolate a multi-level isosurface and watch how that surface changes over both time and space. The algorithm is implemented within a computational steering environment which enables the visualization routines to operate on the data in-situ (while the simulation is ongoing).

关键词： scientific visualization AMR visualization feature tracking distributed visualization problem solving environment

来源：评论

学校读者我要写书评

暂无评论

Study and implementation on parallel processing algorithm for DEPS

Study and implementation on parallel processing algorithm fo...

引用

23rd International Geoscience and Remote Sensing symposium (IGARSS 2003)

作者： Zhu, LF Shao, Y Fan, XT Guo, HD Chinese Acad Sci Inst Remote Sensing Applicat Lab Digital Earth Sci Beijing 100101 Peoples R China

ISBN: (纸本)0780379292

A study on efficient visualization and real-time interactivity of large-scale scenes was discussed in this paper. Introducing the parallel processing technology, we present a paralletizable strategy with the pipeline algorithm, realize this parallel algorithm based on shared-memory, and then apply this program to Test Site, Peking Olympic Games planning mixed scenes, including real-time rendering, dynamically textures loading, quickly browsing and so on. The results show a running performance and real-time interactivity improvement of DEPS when using this algorithm. The parallel program of this paper was developed and running on a Silicon graphics multiprocessor, Onyx 3200, with four MIPS R12000 processors and InfiniteReality3 graphic accelerator, under IRIX 6.5 operating system.

关键词： virtual environment real-time simulation parallel processing shared-memory model

来源：评论

学校读者我要写书评

暂无评论

Optimal generation of transfer functions for direct volume rendering 35

Optimal generation of transfer functions for direct volume r...

引用

35th Southeastern symposium on System Theory

作者： Nicoletti, GM Univ Pittsburgh Greensburg PA 15601 USA

ISBN: (纸本)0780376978

Volume rendering implements the visualization of 3D structures without a prior segmentation process. Direct volume rendering is a key imaging technology for visualizing large 3D data sets from scientific or medical applications. visualization is rendered by transfer functions which assign optical properties such as color, opacity and shading to original values of the data set being visualized. Constructing appropriate transfer functions is a tedious task, generally requiring substantial hand tuning for each new data set and often done by trial and error.,This paper introduces a semiautomatic method of transfer function generation which makes volume rendering surfaces more intuitive and less labor intensive. Fundamentally, this method rests on an algorithm that computes the boundary characteristics in a volume and uses this information to guide the user toward opacity function settings which readily display the boundaries.

关键词： Biomedical equipment Biomedical optical imaging data visualization Histograms Image segmentation Medical services Optical imaging Rendering (computer graphics) Transfer functions User interfaces

来源：评论

学校读者我要写书评

暂无评论

Visibility Culling Using Plenoptic Opacity Functions for large Volume visualization

Visibility Culling Using Plenoptic Opacity Functions for Lar...

引用

VIS 2003 PROCEEDINGS

作者： Gao, Jinzhu Huang, Jian Shen, Han-Wei Kohl, James Arthur Oak Ridge National Lab Oak Ridge TN United States

Visibility culling has the potential to accelerate large data visualization in significant ways. Unfortunately, existing algorithms do not scale well when parallelized, and require full re-computation whenever the opacity transfer function is modified. To address these issues, we have designed a Plenoptic Opacity Function (POF) scheme to encode the view-dependent opacity of a volume block. POFs are computed off-line during a pre-processing stage, only once for each block. We show that using POFs is (i) an efficient, conservative and effective way to encode the opacity variations of a volume block for a range of views, (ii) flexible for re-use by a family of opacity transfer functions without the need for additional off-line processing, and (iii) highly scalable for use in massively parallel implementations. Our results confirm the efficacy of POFs for visibility culling in large-scale parallel volume rendering;we can interactively render the Visible Woman dataset using software ray-casting on 32 processors, with interactive modification of the opacity transfer function on-the-fly.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：