Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Arbitrary topology shape reconstruction from planar cross sections
Graphical Models and Image Processing
Shape transformation using variational implicit functions
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Optimal surface reconstruction from planar contours
Communications of the ACM
Distance Field Manipulation of Surface Models
IEEE Computer Graphics and Applications
Approximating complex surfaces by triangulation of contour lines
IBM Journal of Research and Development
| Hi-index | 0.00 |
This paper describes a novel algorithm for surface reconstruction from slices. A number of slices are extracted from a given data oriented along any of the principal axes. Slices are projected onto the XZ plane and equal number of traversals takes place for each slice by a cut plane oriented along the X axis. As the cut plane traverses along each slice, cut points are extracted. To establish correspondence between two consecutive slices, firstly domain mapping takes place. Then a heuristic approach is taken which is based on the comparison of the number of occurrences of particular cut points between slices. Optimization is performed on the basis of minimal differences of the number of occurrences of particular cut points between consecutive slices. Although heuristic approach is not flawless, this algorithm is able to construct surface of fairly complex objects. The algorithm is dynamic enough as the number of slices and the number of traversals can be adjusted depending on the complexity of the object.