The Visual Computer

, Volume 9, Issue 4, pp 182–199

Adaptive generation of surfaces in volume data

Original Articles

DOI: 10.1007/BF01901723

Cite this article as:
Müller, H. & Stark, M. The Visual Computer (1993) 9: 182. doi:10.1007/BF01901723


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.

Key words

Volume visualizationMarching cubesAdaptive subdivisionGeneric surfaces

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  1. 1.Institut für InformatikUniversität FreiburgFreiburgFederal Republic of Germany