Find Index To LUT Intersection ?
نویسندگان
چکیده
The Marching Cubes algorithm is a popular high-resolution isosurface extraction method used in volume data visualization. However, it is relatively computationally intensive making real-time operation on normal workstations a di cult goal when applied to large datasets. One solution is to transform the serial algorithm into a vector-parallel algorithm designed to exploit the potential computing power supplied by a supercomputer. In this paper, we present an implementation of the Marching Cubes that considers the inherent parallelism in the algorithm as well as the speci c characteristics of the pipelined CPU of a vector-parallel supercomputer (Cray C90). In our approach, we vectorize two time-consuming operations in the Marching Cubes. The rst operation is the interpolation of the intersection points between the isosurface and the cube edges. The second vectorized operation is the computation of topological equivalences for classes of intersections. In this paper, we describe the details of our parallel algorithm and present the experimental results for several typical volume datasets.
منابع مشابه
Computing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملOptimal look-up table-based data hiding
In this study, the authors present a novel data hiding scheme using the minimum distortion look-up table (LUT) embedding that achieves good distortion-robustness performance. LUT-based data hiding is a simple and efficient way to embed information into multimedia content for various applications, such as transaction tracking and database annotation. The authors find it possible to optimally red...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملEstimation of leaf area index and its sunlit portion from DSCOVR EPIC data: Theoretical basis.
This paper presents the theoretical basis of the algorithm designed for the generation of leaf area index and diurnal course of its sunlit portion from NASA's Earth Polychromatic Imaging Camera (EPIC) onboard NOAA's Deep Space Climate Observatory (DSCOVR). The Look-up-Table (LUT) approach implemented in the MODIS operational LAI/FPAR algorithm is adopted. The LUT, which is the heart of the appr...
متن کاملLarge Deviations for Renormalized Self - Intersection Local times of Stable Processes
We study large deviations for the renormalized self-intersection local time of d-dimensional stable processes of index β ∈ (2d/3, d]. We find a difference between the upper and lower tail. In addition, we find that the behavior of the lower tail depends critically on whether β < d or β = d.
متن کامل