San Francisco, California
Oct. 27, 1996 to Nov. 1, 1996
Han-Wei Shen , University of Utah
Charles D. Hansen , Los Alamos National Laboratory
Yarden Livnat , University of Utah
Christopher R. Johnson , University of Utah
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 balancing for massively parallel machines with distributed memory architectures.
Han-Wei Shen, Charles D. Hansen, Yarden Livnat, Christopher R. Johnson, "Isosurfacing in Span Space with Utmost Efficiency (ISSUE)", IEEE_VIS, 1996, Visualization Conference, IEEE, Visualization Conference, IEEE 1996, pp. 287, doi:10.1109/VISUAL.1996.568121