Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Octrees for faster isosurface generation
ACM Transactions on Graphics (TOG)
Segmentation and surface-based modeling of objects in three-dimensional biomedical images
Segmentation and surface-based modeling of objects in three-dimensional biomedical images
Octree-based decimation of marching cubes surfaces
Proceedings of the 7th conference on Visualization '96
Semi-regular mesh extraction from volumes
Proceedings of the conference on Visualization '00
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Speeding Up Isosurface Extraction Using Interval Trees
IEEE Transactions on Visualization and Computer Graphics
Optimal Memory Constrained Isosurface Extraction
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
Visualization-Specific Compression of Large Volume Data
PG '01 Proceedings of the 9th Pacific Conference on Computer Graphics and Applications
Manifold-based approach to semi-regular remeshing
Graphical Models
Preserving sharp edges in geometry images
Proceedings of Graphics Interface 2009
| Hi-index | 0.00 |
Polygonal approximations of isosurfaces extracted from uniformly sampled volumes are increasing in size due to the availability of higher resolution imaging techniques. The large number of primitives represented hinders the interactive exploration of the dataset. Though many solutions have been proposed to this problem, many require the creation of isosurfaces at multiple resolutions or the use of additional data structures, often hierarchical, to represent the volume.We propose a technique for adaptive isosurface extraction that is easy to implement and allows the user to decide the degree of adaptivity as well as the choice of isosurface extraction algorithm. Our method optimizes the extraction of the isosurface by warping the volume. In a warped volume, areas of importance (e.g. containing significant details) are inflated while unimportant ones are contracted. Once the volume is warped, any extraction algorithm can be applied. The extracted mesh is subsequently unwarped such that the warped areas are rescaled to their initial proportions. The resulting isosurface is represented by a mesh that is more densely sampled in regions decided as important.