Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Shape reconstruction from planar cross sections
Computer Vision, Graphics, and Image Processing
Octree-based decimation of marching cubes surfaces
Proceedings of the 7th conference on Visualization '96
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing
IEEE Transactions on Visualization and Computer Graphics
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
MICCAI '98 Proceedings of the First International Conference on Medical Image Computing and Computer-Assisted Intervention
"Skeleton climbing": fast isosurfaces with fewer triangles
PG '97 Proceedings of the 5th Pacific Conference on Computer Graphics and Applications
Isosurface Reconstruction with Topology Control
PG '02 Proceedings of the 10th Pacific Conference on Computer Graphics and Applications
The asymptotic decider: resolving the ambiguity in marching cubes
VIS '91 Proceedings of the 2nd conference on Visualization '91
Compatible Triangulations of Spatial Decompositions
VIS '04 Proceedings of the conference on Visualization '04
VIS '04 Proceedings of the conference on Visualization '04
High-Quality Extraction of Isosurfaces from Regular and Irregular Grids
IEEE Transactions on Visualization and Computer Graphics
IEEE Transactions on Visualization and Computer Graphics
Computational Geometry: Theory and Applications
Cardiac unfold: a novel technique for image-guided cardiac catheterization procedures
IPCAI'12 Proceedings of the Third international conference on Information Processing in Computer-Assisted Interventions
| Hi-index | 0.00 |
In this paper we describe a novel 3-D subdivision strategy to extract the surface of binary image data. This iterative approach generates a series of surface meshes that capture different levels of detail of the underlying structure. At the highest level of detail, the resulting surface mesh generated by our approach uses only about 10% of the triangles in comparison to the marching cube algorithm (MC) even in settings were almost no image noise is present. Our approach also eliminates the so-called 'staircase effect' which voxel based algorithms like the MC are likely to show, particularly if non-uniformly sampled images are processed. Finally, we show how the presented algorithm can be parallelized by subdividing 3-D image space into rectilinear blocks of subimages. As the algorithm scales very well with an increasing number of processors in a multi-threaded setting, this approach is suited to process large image data sets of several gigabytes. Although the presented work is still computationally more expensive than simple voxel based algorithms, it produces fewer surface triangles while capturing the same level of detail, is more robust towards image noise and eliminates the above mentioned 'stair-case' effect in anisotropic settings. These properties make it particularly useful for biomedical applications, where these conditions are often encountered.