Smooth signed distance surface reconstruction and applications

12Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We describe a new and simple variational formulation to reconstruct the surface geometry, topology, and color map of a 3D scene from a finite set of colored oriented points. Point clouds are nowadays obtained using a variety of techniques, including structured lighting systems, pasive multi-view stereo algorithms, and 3D laser scanning. In our formulation the implicit function is forced to be a smooth approximation of the signed distance function to the surface. The formulation allows for a number of different efficient discretizations, reduces to a finite dimensional least squares problem for all linearly parameterized families of functions, does not require the specification of boundary conditions, and it is particularly good at extrapolating missing and/or irregularly sampled data. The resulting algorithms are significantly simpler and easier to implement than alternative methods. In particular, our implementation based on a primal-graph octree-based hybrid finite element-finite difference discretization, and the Dual Marching Cubes isosurface extraction algorithm is very efficient, and produces high quality crack-free adaptive manifold polygon meshes. After the geometry and topology are reconstructed, the color information from the points is smoothly extrapolated to the surface by solving a second variational problem which also reduces to a finite dimensional least squares problem. The resulting method produces high quality polygon meshes with smooth color maps, which accurately approximate the source colored oriented points. An open source implementation of this method is available for download. We describe applications to digital archaeology, 3D forensics, and 3D broadcasting. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Taubin, G. (2012). Smooth signed distance surface reconstruction and applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7441 LNCS, pp. 38–45). https://doi.org/10.1007/978-3-642-33275-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free