Adaptive generation of surfaces in volume data |
| |
Authors: | Heinrich Müller Michael Stark |
| |
Affiliation: | (1) Institut für Informatik, Universität Freiburg, Rheinstrasse 10-12, W-7800 Freiburg, Federal Republic of Germany |
| |
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. |
| |
Keywords: | Volume visualization Marching cubes Adaptive subdivision Generic surfaces |
本文献已被 SpringerLink 等数据库收录! |