Massively parallel isosurface extraction

2 January 2003

proceedings article
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 77-83
https://doi.org/10.1109/visual.1992.235223

Abstract

We describe experiences during the investigation of parallel methods for faster isosurface generation on SIMD machines. A sequential version of a well known isosurfacing algorithm is algorithmically enhanced for a particular type of SIMD architecture. The SIMD implementation takes full advantage of the data parallel nature of the algorithm and experiments have proven the implementation to be highly scalable. A parallel tool, which can generate 170K polygons / second, gives scientists the means to explore large 3D scalar or vector fields interactively.

Keywords

This publication has 5 references indexed in Scilit:

The asymptotic decider: resolving the ambiguity in marching cubes
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Octrees for faster isosurface generation
Published by Association for Computing Machinery (ACM) ,1990
Efficient ray tracing of volume data
ACM Transactions on Graphics, 1990
Marching cubes: A high resolution 3D surface construction algorithm
ACM SIGGRAPH Computer Graphics, 1987
Geometric modeling using octree encoding
Computer Graphics and Image Processing, 1982