Isosurfacing in Span Space with Utmost Efficiency (ISSUE)

We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are described. We also present a parallel implementation with an emphasis on load balancing. The performance of our sequential algorithm to locate the cell elements intersected by isosurfaces is faster than the Kd-tree searching method originally used for the Span Space algorithm. The parallel algorithmcan achieve high load balancingfor massively parallel machines with distributed memory architectures.

• Type: Conference
• Year: 1996
• Where: VISUALIZATION
• Authors: Han-Wei Shen, Charles D. Hansen, Yarden Livnat, Christopher R. Johnson
• Keywords: Parallel Algorithms, Span Space, Span Space Data, Visualization, VISUALIZATION 1996