Abstract
The generation of polygonal approximations of iso-surfaces or separating surfaces in volume data is a major method in scientific visualization. A widespread approach for this task is the so-called marching cubes algorithm. The marching cubes algorithm, however, has the disadvantage that the number of polygonal chains generated is considerable. The splitting box algorithm presented in this paper 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 separating surface. The 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
