23 June 1993 Fast solution to the surface reconstruction problem
Author Affiliations +
Abstract
Surface reconstruction from range data acquired using a variety of sources has been a very active area of research in computational vision over the past decade. Generalized splines have emerged as the single most popular approximation tool to this end. In this paper we present a new and fast algorithm for solving the surface reconstruction problem using the membrane spline which yields a C0 surface. Our algorithm for dense data constraints takes O(N) computational time, where N is the number of nodes in the discretization. For sparse data constraints, the algorithm requires O(log N/(pi) 2) iterations with each iteration taking O(N) time. The number of iterations in this case depends on a prespecified error tolerance. We demonstrate the algorithm performance on synthesized sparse range data.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Baba C. Vemuri, Baba C. Vemuri, S. H. Lai, S. H. Lai, } "Fast solution to the surface reconstruction problem", Proc. SPIE 2031, Geometric Methods in Computer Vision II, (23 June 1993); doi: 10.1117/12.146638; https://doi.org/10.1117/12.146638
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT


Back to Top