Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Surface modeling method by polygonal primitives for visualizing three-dimensional volume data
The Visual Computer: International Journal of Computer Graphics
On generating topologically consistent isosurfaces from uniform samples
The Visual Computer: International Journal of Computer Graphics
Re: additional reference to "marching cubes"
ACM SIGGRAPH Computer Graphics
Improving the Robustness and Accuracy of the Marching Cubes Algorithm for Isosurfacing
IEEE Transactions on Visualization and Computer Graphics
Direct reconstruction of a displaced subdivision surface from unorganized points
Graphical Models - Pacific graphics 2001
Iso-Splatting: A Point-Based Alternative to Isosurface Visualization
PG '03 Proceedings of the 11th 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
| Hi-index | 0.00 |
This paper addresses a new surface reconstruction scheme for approximating the isosurface from a set of tomographic cross sectional images. Differently from the novel Marching Cubes (MC) algorithm, our method does not extract the iso-density surface (isosurface) directly from the voxel data but calculates the iso-density point (isopoint) first. After building a coarse initial mesh approximating the ideal isosurface by the cell-boundary representation, it metamorphoses the mesh into the final isosurface by a relaxation scheme, called shrink-wrapping process. Compared with the MC algorithm, our method is robust and does not make any cracks on surface. Furthermore, since it is possible to utilize lots of additional isopoints during the surface reconstruction process by extending the adjacency definition, theoretically the resulting surface can be better in quality than the MC algorithm. According to experiments, it is proved to be very robust and efficient for isosurface reconstruction from cross sectional images.