Parallel accelerated isocontouring for out-of-core visualization
CL Bajaj, V Pascucci, D Thompson… - Proceedings of the 1999 …, 1999 - dl.acm.org
In this paper we introduce a scheme for static analysis that allows us to partition large
geometric datasets at multiple levels of granularity to achieve both load balancing in parallel …
geometric datasets at multiple levels of granularity to achieve both load balancing in parallel …
Topologically defined isosurfaces
JO Lachaud - Discrete Geometry for Computer Imagery: 6th …, 1996 - Springer
In this article, we present a new process for defining and building the set of configurations of
Marching-Cubes algorithms. Our aim is to extract a topologically correct isosurface from a …
Marching-Cubes algorithms. Our aim is to extract a topologically correct isosurface from a …
PM2: un environnement pour une conception portable et une exécution efficace des applications parallèles irrégulières
R Namyst - 1997 - theses.fr
Ce travail s' inscrit dans le cadre du projet espace dont l'objectif est de définir un cadre
méthodologique ainsi qu'un environnement de développement pour la conception …
méthodologique ainsi qu'un environnement de développement pour la conception …
An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering
Q Wang, J JaJa, A Varshney - Proceedings 20th IEEE …, 2006 - ieeexplore.ieee.org
We consider the problem of isosurface extraction and rendering for large scale time varying
data. Such datasets have been appearing at an increasing rate especially from physics …
data. Such datasets have been appearing at an increasing rate especially from physics …
Efficient parallel out-of-core isosurface extraction
H Zhang, TS Newman - IEEE Symposium on Parallel and Large …, 2003 - ieeexplore.ieee.org
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 …
efficient parallel isosurfacing when the dataset cannot be processed entirely in-core. The …
High performance SIMD marching cubes isosurface extraction on commodity computers
TS Newman, JB Byrd, P Emani, A Narayanan… - Computers & …, 2004 - Elsevier
Approaches to achieve high performance for volume visualization via the popular Marching
Cubes algorithm on commodity x86 personal computers are described. The approaches …
Cubes algorithm on commodity x86 personal computers are described. The approaches …
地学中海量数据的并行可视化研究进展
陈绍林， 张怀， 石耀霖 - 中国科学院大学学报, 2008 - journal.ucas.ac.cn
地球科学中观测和数值模拟结果数据爆炸式的增长, 给可视化和分析这些海量数据带来了极大的
挑战, 将海量数据并行可视化技术应用到地球科学中是解决这一问题的有效手段 …
挑战, 将海量数据并行可视化技术应用到地球科学中是解决这一问题的有效手段 …
Volumic segmentation using hierarchical representation and triangulated surface
JO Lachaud, A Montanvert - Computer Vision—ECCV'96: 4th European …, 1996 - Springer
This article presents a new algorithm for segmenting 3D images. It is based on a dynamic
triangulated surface and on a pyramidal representation. The triangulated surface, which can …
triangulated surface and on a pyramidal representation. The triangulated surface, which can …
A Parallel Algorithm to Reconstruct Bounding Surfaces in 3D Images
FH Mabin, C Mongenet - The Journal of Supercomputing, 1998 - Springer
The growing size of 3D digital images causes sequential algorithms to be less and less
usable on whole images and a parallelization of these algorithm is often required. We have …
usable on whole images and a parallelization of these algorithm is often required. We have …