Share Email Print

Proceedings Paper

Fast solution to the surface reconstruction problem
Author(s): Baba C. Vemuri; S. H. Lai
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 23 June 1993
PDF: 11 pages
Proc. SPIE 2031, Geometric Methods in Computer Vision II, (23 June 1993); doi: 10.1117/12.146638
Show Author Affiliations
Baba C. Vemuri, Univ. of Florida (United States)
S. H. Lai, Univ. of Florida (United States)

Published in SPIE Proceedings Vol. 2031:
Geometric Methods in Computer Vision II
Baba C. Vemuri, Editor(s)

© SPIE. Terms of Use
Back to Top