ISSN:
1432-2315
Keywords:
Volume visualization
;
Marching cubes
;
Adaptive subdivision
;
Generic surfaces
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract A widespread approach to generating polygonal approximations of iso-surfaces or contour surfaces in volume data is the socalled marching-cubes algorithm. This algorithm, however, has the disadvantage that the number of polygonal chains generated is considerable. The splitting-box algorithm presented here reduces the number of polygonal chains by adapting their size to the shape of the surface. The resulting polygonal chains offer a wide spectrum for representing the contour surface. An exact representation is achieved by a new type of generic patches calculated from the polygonal chains. Approximations of different quality may be obtained by combining the algorithm generating the patches with simple triangulations.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01901723
Permalink
