By Topic

Fast isosurface generation using the volume thinning algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Itoh, T. ; IBM Res., Tokyo Res. Lab., Kanagawa, Japan ; Yamaguchi, Y. ; Koyamada, K.

One of the most effective techniques for developing efficient isosurfacing algorithms is the reduction of visits to nonisosurface cells. Recent algorithms have drastically reduced the unnecessary cost of visiting nonisosurface cells. The experimental results show almost optimal performance in their isosurfacing processes. However, most of them have a bottleneck in that they require more than O(n) computation time for their preprocessing, where n denotes the total number of cells. We propose an efficient isosurfacing technique, which can be applied to unstructured as well as structured volumes and which does not require more than O(n) computation time for its preprocessing. A preprocessing step generates an extrema skeleton, which consists of cells and connects all extremum points, by the volume thinning algorithm. All disjoint parts of every isosurface intersect at least one cell in the extrema skeleton. Our implementation generates isosurfaces by searching for isosurface cells in the extrema skeleton and then recursively visiting their adjacent isosurface cells, while it skips most of the nonisosurface cells. The computation time of the preprocessing is estimated as O(n). The computation time of the isosurfacing process is estimated as O(n1/3m+k), where k denotes the number of isosurface cells and m denotes the number of extremum points since the number of cells in an extrema skeleton is estimated as O(n1/3m)

Published in:

Visualization and Computer Graphics, IEEE Transactions on  (Volume:7 ,  Issue: 1 )