We present the chain-gang algorithm for isosurfacerendering of super adaptive resolution (SAR) volumedata in order to minimize (1) the space needed for storage of boththe data and the isosurface and (2) the the time taken forcomputation. The chain-gang algorithm is able to resolvediscontinuities in SAR data sets. Unnecessary computation isavoided by skipping over large sets of volume data deemeduninteresting. Memory space is saved by leaving the uninterestingvoxels out of our octree data structure used to traverse the volumedata. Our isosurface generation algorithm extends the MarchingCubes Algorithm in order to handle inconsistencies that can arisebetween abutting cells that are separated by both one and twolevels of resolution.
CITATION STYLE
Laramee, R. S., & Bergeron, R. D. (2002). An Isosurface Continuity Algorithm for Super Adaptive Resolution Data *. In Advances in Modelling, Animation and Rendering (pp. 215–237). Springer London. https://doi.org/10.1007/978-1-4471-0103-1_14
Mendeley helps you to discover research relevant for your work.