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

ieee symposium on large data Analysis and visualization

作者： Widanagamaachchi, Wathsala Bremer, Peer-Timo Sewell, Christopher Lo, Li-Ta Ahrens, James Pascucci, Valerio Univ Utah SCI Inst Salt Lake City UT 84112 USA Lawrence Livermore Natl Lab Livermore CA USA Los Alamos Natl Lab Los Alamos NM USA

ISBN: (纸本)9781479952151

State-of-the-art cosmological simulations regularly contain billions of particles, providing scientists the opportunity to study the evolution of the Universe in great detail. However, the rate at which these simulations generate data severely taxes existing analysis techniques. Therefore, developing new scalable alternatives is essential for continued scientific progress. Here, we present a dataparallel, friends-of-friends halo finding algorithm that provides unprecedented flexibility in the analysis by extracting multiple linking lengths. Even for a single linking length, it is as fast as the existing techniques, and is portable to multi-threaded many-core systems as well as co-processing resources. Our system is implemented using PISTON and is coupled to an interactive analysis environment used to study halos at different linking lengths and track their evolution over time.

关键词： H.3 [INFORMATION STORAGE AND RETRIEVAL]: Information Search and Retrieval Clustering J.2 [PHYSICAL SCIENCES AND ENGINEERING]: Astronomy

来源：评论

学校读者我要写书评

暂无评论

Cubic Gradient-Based Material Interfaces

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2013年第10期19卷 1687-1699页

作者： Prilepov, Iuri Obermaier, Harald Deines, Eduard Garth, Christoph Joy, Kenneth I. Univ Calif Davis Dept Comp Sci Inst Data Anal & Visualizat Davis CA 95616 USA CD Adapco Austin TX 78750 USA Tech Univ Kaiserslautern D-67653 Kaiserslautern Germany

Multifluid simulations often create volume fraction data, representing fluid volumes per region or cell of a fluid data set. Accurate and visually realistic extraction of fluid boundaries is a challenging and essential task for efficient analysis of multifluid data. In this work, we present a new material interface reconstruction method for such volume fraction data. Within each cell of the data set, our method utilizes a gradient field approximation based on trilinearly blended Coons-patches to generate a volume fraction function, representing the change in volume fractions over the cells. A continuously varying isovalue field is applied to this function to produce a smooth interface that preserves the given volume fractions well. Further, the method allows user-controlled balance between volume accuracy and physical plausibility of the interface. The method works on two-and three-dimensional Cartesian grids, and handles multiple materials. Calculations are performed locally and utilize only the one-ring of cells surrounding a given cell, allowing visualizations of the material interfaces to be easily generated on a GPU or in a large-scale distributed parallel environment. Our results demonstrate the robustness, accuracy, and flexibility of the developed algorithms.

关键词： visualization boundary representations computational geometry and object modeling

来源：评论

学校读者我要写书评

暂无评论

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

引用

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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Eurographics symposium on parallel graphics and visualization, EGPGV 2007

Eurographics Symposium on Parallel Graphics and Visualizatio...

引用

7th Eurographics symposium on parallel graphics and visualization, EGPGV 2007

ISBN: (纸本)9783905673500

The proceedings contain 13 papers. The topics discussed include: multiresolution visualization of massive models on a large spatial 3D display;distributed collaborative data analysis with heterogeneous visualization systems;direct send compositing for parallel sort-last rendering;interactive particle visualization with advanced shading models using lazy evaluation;scalable sort-first parallel direct volume rendering with dynamic load balancing;dynamic regions of interest for interactive flow exploration;work stealing for time-constrained octree exploration: application to real-time 3D modeling;exploiting parallelism in physically-based simulations on multi-core processor architectures;parallel reflective symmetry transformation for volume data;and asynchronous BVH construction for ray tracing dynamic scenes on parallel multi-core architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Eurographics Workshop on parallel graphics and visualization

Eurographics Workshop on Parallel Graphics and Visualization

引用

2016 Eurographics symposium on parallel graphics and visualization, EGPGV 2016

ISBN: (纸本)9783038680062

The proceedings contain 10 papers. The topics discussed include: adaptive collision culling for large-scale simulations by a parallel sweep and prune algorithm;external face-list calculation with data-parallel primitives;parallel spatial splits in bounding volume hierarchies;interacting with large distributed datasets using sketch;high-performance mesh partitioning and ghost cell generation for visualization software;web-enabled server-based and distributed real-time ray-tracing;a scalable streamline generation algorithm via flux-based isocontour extraction;dynamically scheduled region-based image compositing;dynamic work packages in parallel rendering;and data mining tornado-genesis precursors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enabling access to timeseries, geospatial data for on-demand visualization

Enabling access to timeseries, geospatial data for on-demand...

引用

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

作者： Pallickara, Sangmi Lee Malensek, Matthew Pallickara, Shrideep Department of Computer Science Colorado State University United States

ISBN: (纸本)9781467301541

data volumes in the geosciences have been increasing substantially over the past decade. This data naturally includes both spatial and chronological information. Fast access to specific portions of large collections of such datasets is a precursor to efficiently visualizing them. Here, we provide an overview of how a geospatial storage system, GALILEO, provides storage of such timeseries data while providing access to specific portions of the dataset. © 2011 ieee.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

visualization of fibrous and thread-like data

引用

ieee TRANSACTIONS ON visualization AND COMPUTER graphics 2006年第5期12卷 1165-1172页

作者： Melek, Zeki Mayerich, David Yuksel, Cem Keyser, John Texas A&M Univ College Stn TX 77843 USA

Thread-like structures are becoming more common in modern volumetric data sets as our ability to image vascular and neural tissue at higher resolutions improves. The thread-like structures of neurons and micro-vessels pose a unique problem in visualization since they tend to be densely packed in small volumes of tissue. This makes it difficult for an observer to interpret useful patterns from the data or trace individual fibers. In this paper we describe several methods for dealing with large amounts of thread-like data, such as data sets collected using Knife-Edge Scanning Microscopy (KESM) and Serial Block-Face Scanning Electron Microscopy (SBF-SEM). These methods allow us to collect volumetric data from embedded samples of whole-brain tissue. The neuronal and microvascular data that we acquire consists of thin, branching structures extending over very large regions. Traditional visualization schemes are not sufficient to make sense of the large, dense, complex structures encountered. In this paper, we address three methods to allow a user to explore a fiber network effectively. We describe interactive techniques for rendering large sets of neurons using self-orienting surfaces implemented on the GPU. We also present techniques for rendering fiber networks in a way that provides useful information about flow and orientation. Third, a global illumination framework is used to create high-quality visualizations that emphasize the underlying fiber structure. Implementation details, performance, and advantages and disadvantages of each approach are discussed.

关键词： neuron visualization GPU acceleration global illumination orientation filtering

来源：评论

学校读者我要写书评

暂无评论

Task-based Augmented Merge Trees with Fibonacci Heaps 7

Task-based Augmented Merge Trees with Fibonacci Heaps

引用

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

作者： Gueunet, Charles Fortin, Pierre Jomier, Julien Tierny, Julien UPMC Univ Paris 06 Sorbonne Univ CNRS Kitware SASLIP6UMR 7606 Paris France UPMC Univ Paris 06 Sorbonne Univ CNRS LIP6UMR 7606 Paris France Kitware SAS Villeurbanne France

ISBN: (纸本)9781538606179

This paper presents a new algorithm for the fast, shared memory multi-core computation of augmented merge trees on triangulations. In contrast to most existing parallel algorithms, our technique computes augmented trees. This augmentation is required to enable the full extent of merge tree based applications, including data segmentation. Our approach completely revisits the traditional, sequential merge tree algorithm to re-formulate the computation as a set of independent local tasks based on Fibonacci heaps. This results in superior time performance in practice, in sequential as well as in parallel thanks to the OpenMP task runtime. In the context of augmented contour tree computation, we show that a direct usage of our merge tree procedure also results in superior time performance overall, both in sequential and parallel. We report performance numbers that compare our approach to reference sequential and multi-threaded implementations for the computation of augmented merge and contour trees. These experiments demonstrate the runtime efficiency of our approach as well as its scalability on common workstations. We demonstrate the utility of our approach in data segmentation applications. We also provide a lightweight VTK-based C++ implementation of our approach for reproduction purposes.

关键词： Algorithm design and analysis data analysis data visualization Feature extraction Electronic mail Runtime

来源：评论

学校读者我要写书评

暂无评论

GraphRay: Distributed Pathfinder Network Scaling 7

GraphRay: Distributed Pathfinder Network Scaling

引用

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

作者： Arleo, Alessio Kwon, Oh-Hyun Ma, Kwan-Liu Univ Perugia Perugia Italy Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781538606179

Pathfinder network scaling is a graph sparsification technique that has been popularly used due to its efficacy of extracting the "important" structure of a graph. However, existing algorithms to compute the pathfinder network (PFNET) of a graph have prohibitively expensive time complexity for large graphs: O(n(3)) for the general case and O(n(2) logn) for a specific parameter setting, PFNET(r = infinity, q = n-1), which is considered in many applications. In this paper, we introduce the first distributed technique to compute the pathfinder network with the specific parameters (r = 8 and q = n-1) of a large graph with millions of edges. The results of our experiments show our technique is scalable;it efficiently utilizes a parallel distributed computing environment, reducing the running times as more processing units are added.

关键词： data visualization Distributed algorithms Algorithm design and analysis Time complexity visualization Electronic mail Programming

来源：评论

学校读者我要写书评

暂无评论

Redirecting research in large-format displays for visualization

Redirecting research in large-format displays for visualizat...

引用

2nd symposium on large-Scale data Analysis and visualization, LDAV 2012

作者： Moreland, Kenneth

ISBN: (纸本)9781467347334

large-format displays, in particular tiled displays, remain actively used and researched today after almost two decades since their conception. Many government, academic, and commercial entities have invested considerably in the construction and use of large-format displays. During this time we have developed new applications but have also discovered faulty assumptions. This position paper evaluates the most important lessons learned from early and recent research in large-format displays. Each lesson suggests a direction for future research, which generally takes the form of a more user- and application-centric focus. © 2012 ieee.

关键词： large format DISPLAYING visualization redirection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：