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

ieee Pacific visualization symposium (PacificVis)

作者： Acharya, Aditya Natarajan, Vijay Indian Inst Sci Supercomp Educ & Res Ctr Bangalore Karnataka India Indian Inst Sci Supercomp Educ & Res Ctr Dept Comp Sci & Automat Bangalore Karnataka India

ISBN: (纸本)9781467368797

The contour tree is a topological structure associated with a scalar function that tracks the connectivity of the evolving level sets of the function. It supports intuitive and interactive visual exploration and analysis of the scalar function. This paper describes a fast, parallel, and memory efficient algorithm for constructing the contour tree of a scalar function on shared memory systems. Comparisons with existing implementations show significant improvement in both the running time and the memory expended. The proposed algorithm is particularly suited for large datasets that do not fit in memory. For example, the contour tree for a scalar function defined on a 8.6 billion vertex domain (2048 x 2048 x 2048 volume data) can be efficiently constructed using less than 10GB of memory.

关键词： I.3.5 [Computer graphics]: Computational Geometry and Object Modeling SCALAR FUNCTIONS efficient algorithm Memory Memory contour Trees topological structure

来源：评论

学校读者我要写书评

暂无评论

Scalable multivariate volume visualization and analysis

Scalable multivariate volume visualization and analysis

引用

1st ieee symposium on large-Scale data Analysis and visualization 2011, LDAV 2011

作者： Guo, Hanqi Xiao, He Lu, Min Yuan, Xiaoru School of EECS Peking University Beijing China Center for Computational Science and Engineering Peking University Beijing China

ISBN: (纸本)9781467301541

In this work, we present an effective and scalable system for multivariate volume data visualization and analysis with a novel Transfer Function (TF) interface design that tightly couples parallel coordinates plots (PCP) and MDS-based dimension projection plots. In our system, the PCP visualizes the data distribution of each variate and the MDS plots project features. Together, they are integrated seamlessly to provide flexible feature classification without context switching between different data presentations during the user interaction. The proposed interface enables users to identify relevant correlation clusters and assign optical properties on them. To further support large scale multivariate volume data visualization and analysis, we develop three integrated parallel systems to accelerate the rendering of PCP, the layout of MDS, as well as parallel rendering of multivarite volume data. Our experiments show that the system is effective in multivariate volume data visualization and its performance is scalable for data sets with different sizes and number of variates. © 2011 ieee.

关键词： Transfer functions

来源：评论

学校读者我要写书评

暂无评论

Distributed parallel particle advection using work requesting

Distributed parallel particle advection using work requestin...

引用

2013 3rd ieee symposium on large-Scale data Analysis and visualization, LDAV 2013

作者： Muller, Cornelius Camp, David Hentschel, Bernd Garth, Christoph University of Kaiserslautern Germany Lawrence Berkeley National Laboratory United States RWTH Aachen University Germany

ISBN: (纸本)9781479916597

Particle advection is an important vector field visualization technique that is difficult to apply to very large data sets in a distributed setting due to scalability limitations in existing algorithms. In this paper, we report on several experiments using work requesting dynamic scheduling which achieves balanced work distribution on arbitrary problems with minimal communication overhead. We present a corresponding prototype implementation, provide and analyze benchmark results, and compare our results to an existing algorithm. © 2013 ieee.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Ray Tracing Within a data parallel Framework 8

Ray Tracing Within a Data Parallel Framework

引用

ieee Pacific visualization symposium (PacificVis)

作者： Larsen, Matthew Meredith, Jeremy S. Navratil, Paul A. Childs, Hank Univ Oregon Eugene OR 97403 USA Oak Ridge Natl Lab Oak Ridge TN USA Univ Texas Austin Texas Adv Comp Ctr Austin TX 78712 USA Lawrence Berkeley Natl Lab Berkeley CA USA

ISBN: (纸本)9781467368797

Current architectural trends on supercomputers have dramatic increases in the number of cores and available computational power per die, but this power is increasingly difficult for programmers to harness effectively. High-level language constructs can simplify programming many-core devices, but this ease comes with a potential loss of processing power, particularly for cross-platform constructs. Recently, scientific visualization packages have embraced language constructs centering around data parallelism, with familiar operators such as map, reduce, gather, and scatter. Complete adoption of data parallelism will require that central visualization algorithms be revisited, and expressed in this new paradigm while preserving both functionality and performance. This investment has a large potential payoff: portable performance in software bases that can span over the many architectures that scientific visualization applications run on. With this work, we present a method for ray tracing consisting of entirely of data parallel primitives. Given the extreme computational power on nodes now prevalent on supercomputers, we believe that ray tracing can supplant rasterization as the work-horse graphics solution for scientific visualization. Our ray tracing method is relatively efficient, and we describe its performance with a series of tests, and also compare to leading-edge ray tracers that are optimized for specific platforms. We find that our data parallel approach leads to results that are acceptable for many scientific visualization use cases, with the key benefit of providing a single code base that can run on many architectures.

关键词： Ray tracing data parallel data visualisation supercomputer Raster processing code base Frameworks Computer personnel computational power

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Practical global illumination for interactive particle visualization

引用

COMPUTERS & graphics-UK 2008年第1期32卷 14-24页

作者： Gribble, Christlaan P. Brownlee, Carson Parker, Steven G. Grove City Coll Lab Interact Visualizat Entertainment & Mobil Dept Comp Sci Grove City PA 16217 USA Univ Utah Sci Comput & Imaging Inst Salt Lake City UT 84112 USA

Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resulting state will communicate subtle changes in the three-dimensional structure, spatial organization, and qualitative trends within a simulation as it evolves. We present two algorithms targeting upcoming, highly parallel multicore desktop systems to enable interactive navigation and exploration of large particle data sets with global illumination effects. Monte Carlo path tracing and texture mapping are used to capture computationally expensive illumination effects such as soft shadows and diffuse interreflection. The first approach is based on precomputation of luminance textures and removes expensive illumination calculations from the interactive rendering pipeline. The second approach is based on dynamic luminance texture generation and decouples interactive rendering from the computation of global illumination effects. These algorithms provide visual cues that enhance the ability to perform analysis and feature detection tasks while interrogating the data at interactive rates. We explore the performance of these algorithms and demonstrate their effectiveness using several large data sets. (C) 2007 Elsevier Ltd. All rights reserved.

关键词： interactive particle visualization global illumination ray tracing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Interactive visualization and On-Demand Processing of large Volume data: A Fully GPU-Based Out-of-Core Approach

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2020年第10期26卷 3008-3021页

作者： Sarton, Jonathan Courilleau, Nicolas Remion, Yannick Lucas, Laurent Univ Reims F-51100 Reims France Neoxia F-75008 Paris France

In a wide range of scientific fields, 3D datasets production capabilities have widely evolved in recent years, especially with the rapid increase in their sizes. As a result, many large-scale applications, including visualization or processing, have become challenging to address. A solution to this issue lies in providing out-of-core algorithms specifically designed to handle datasets significantly larger than memory. In this article, we present a new approach that extends the broad interactive addressing principles already established in the field of out-of-core volume rendering on GPUs to allow on-demand processing during the visualization stage. We propose a pipeline designed to manage data as regular 3D grids regardless of the underlying application. It relies on a caching approach with a virtual memory addressing system coupled to an efficient parallel management on GPU to provide efficient access to data in interactive time. It allows any visualization or processing application to leverage the flexibility of its structure by managing multi-modality datasets. Furthermore, we show that our system delivers good performance on a single standard PC with low memory budget on the GPU.

关键词： GPU caching system out-of-core data management large data interactive visualization on-demand processing

来源：评论

学校读者我要写书评

暂无评论

Techniques for data-parallel Searching for Duplicate Elements 7

Techniques for Data-Parallel Searching for Duplicate Element...

引用

ieee 7th symposium on large data Analysis and visualization (LDAV)

作者： Lessley, Brenton Moreland, Kenneth Larsen, Matthew Childs, Hank Univ Oregon Eugene OR 97403 USA Sandia Natl Labs Albuquerque NM USA Lawrence Livermore Natl Lab Livermore CA USA

ISBN: (纸本)9781538606179

We study effective shared-memory, data-parallel techniques for searching for duplicate elements. We consider several data-parallel approaches, and how hash function, machine architecture, and data set can affect performance. We conclude that most choices of algorithm and hash function are problematic for general usage. However, we demonstrate that the choice of the Hash-Fight algorithm with the FNV1a hash function has consistently good performance over all configurations.

关键词： Sorting Computer architecture Indexing Algorithm design and analysis Runtime Electronic mail

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：