Optimal surface reconstruction from planar contours
- 1 October 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (10) , 693-702
- https://doi.org/10.1145/359842.359846
Abstract
In many scientific and technical endeavors, a three-dimensional solid must be reconstructed from serial sections, either to aid in the comprehension of the object's structure or to facilitate its automatic manipulation and analysis. This paper presents a general solution to the problem of constructing a surface over a set of cross-sectional contours. This surface, to be composed of triangular tiles, is constructed by separately determining an optimal surface between each pair of consecutive contours. Determining such a surface is reduced to the problem of finding certain minimum cost cycles in a directed toroidal graph. A new fast algorithm for finding such cycles is utilized. Also developed is a closed-form expression, in terms of the number of contour points, for an upper bound on the number of operations required to execute the algorithm. An illustrated example which involves the construction of a minimum area surface describing a human head is included.Keywords
This publication has 5 references indexed in Scilit:
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- Theory of Image Reconstruction in Computed TomographyRadiology, 1975
- Approximating Complex Surfaces by Triangulation of Contour LinesIBM Journal of Research and Development, 1975
- Three Dimensional Reconstruction from Serial SectionsNature, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969