Optimal surface reconstruction from planar contours
Communications of the ACM
A new general triangulation method for planar contours
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Understanding three-dimensional images: the recognition of abdominal anatomy from computed axial tomograms (cat)
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Pessimal Guesses may be Optimal: A Counterintuitive Search Result
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Transactions on Graphics (TOG)
Piecewise-linear interpolation between polygonal slices
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Hi-index | 0.00 |
This paper is concerned with the problem of reconstructing the surface of three-dimensional objects, given a collection of planar contours representing cross-sections through the objects. This is an important problem, with applications in clinical medicine, bio-medical research and instruction, and industrial inspection. Current solutions to this problem have raised interesting theoretical questions about search techniques and the exploitation of domain-specific aspects of such search problems. In this paper, we survey known reconstruction techniques, describe a testbed for evaluating these techniques and present an improvement on the simple divide-and-conquer method analyzed by Fuchs, Kedem and Uselton [5].