Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Geometrically deformed models: a method for extracting closed geometric models form volume data
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Adaptive generation of surfaces in volume data
The Visual Computer: International Journal of Computer Graphics
An implicit surface polygonizer
Graphics gems IV
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
MAPS: multiresolution adaptive parameterization of surfaces
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A unified approach for hierarchical adaptive tesselation of surfaces
ACM Transactions on Graphics (TOG)
Semi-regular mesh extraction from volumes
Proceedings of the conference on Visualization '00
Curvature-Dependent Triangulation of Implicit Surfaces
IEEE Computer Graphics and Applications
Interactive view-dependent rendering of large isosurfaces
Proceedings of the conference on Visualization '02
Wavelets for adaptively refined 3√2-subdivision meshes
International Journal of Computers and Applications
| Hi-index | 0.00 |
We present a new algorithm for extracting adaptive multiresolution triangle meshes from volume datasets. The algorithm guarantees that the topological genus of the generated mesh is the same as the genus of the surface embedded in the volume dataset at all levels of detail. In addition to this "hard constraint" on the genus of the mesh, the user can choose to specify some number of soft geometric constraints, such as triangle aspect ratio, minimum or maximum total number of vertices, minimum and/or maximum triangle edge lengths, maximum magnitude of various error metrics per triangle or vertex, including maximum curvature (area) error, maximum distance to the surface, and others. The mesh extraction process is fully automatic and does not require manual adjusting of parameters to produce the desired results as long as the user does not specify incompatible constraints. The algorithm robustly handles special topological cases, such as trimmed surfaces (intersections of the surface with the volume boundary), and manifolds with multiple disconnected components (several closed surfaces embedded in the same volume dataset). The meshes may self-intersect at coarse resolutions. However, the self-intersections are corrected automatically as the resolution of the meshes increase. We show several examples of meshes extracted from complex volume datasets.