Title :
Isosurfacing in span space with utmost efficiency (ISSUE)
Author :
Han-Wei Shen ; Hansen, Charles D. ; Livnat, Yarden ; Johnson, Christopher R.
Author_Institution :
Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT, USA
fDate :
Oct. 27 1996-Nov. 1 1996
Abstract :
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 algorithm can achieve high load balancing for massively parallel machines with distributed memory architectures.
Keywords :
feature extraction; ISSUE; Span Space data representation; cell elements; data subdivision; distributed memory architectures; isosurface extraction; load balancing; massively parallel machines; parallel algorithms; parallel implementation; searching methods; sequential algorithm; span space; utmost efficiency; Acceleration; Cities and towns; Computer graphics; Computer science; Concurrent computing; Data mining; Data visualization; High performance computing; Isosurfaces; Laboratories; Large-scale systems; Load management; Memory architecture; Parallel machines; Workstations;
Conference_Titel :
Visualization '96. Proceedings.
Conference_Location :
San Francisco, CA, USA
Print_ISBN :
0-89791-864-9
DOI :
10.1109/VISUAL.1996.568121
