Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions

We describe algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by Savchenko, et al. and later developed independently by Turk and O'Brien as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of large numbers of scattered surface points by using compactly supported radial basis interpolants. The use of compactly supported elements generates a sparse solution space, reducing the computational complexity and making the technique practical for large models. The local nature of compactly supported radial basis functions permits the use of computational techniques and data structures such as k-d trees for spatial subdivision, promoting fast solvers and methods to divide and conquer many of the subproblems associated with these methods. Moreover, the representation of complex models permits the exploration of diverse surface geometry. This reduction in computational complexity enables the application of these methods to the study of shape properties of large complex shapes.

[1]  J. Sethian Level set methods : evolving interfaces in geometry, fluid mechanics, computer vision, and materials science , 1996 .

[2]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid , 2012 .

[3]  Ibrahim N. Hajj,et al.  Parallel circuit simulation on supercomputers , 1989 .

[4]  James F. O'Brien,et al.  Shape transformation using variational implicit functions , 1999, SIGGRAPH 1999.

[5]  J. Duchon Sur l’erreur d’interpolation des fonctions de plusieurs variables par les $D^m$-splines , 1978 .

[6]  Benjamin B. Kimia,et al.  On Optimal Control Methods in Computer Vision and Image Processing , 1994, Geometry-Driven Diffusion in Computer Vision.

[7]  Tosiyasu L. Kunii,et al.  Function Representation of Solids Reconstructed from Scattered Surface Points and Contours , 1995, Comput. Graph. Forum.

[8]  Paul S. Heckbert,et al.  Using particles to sample and control implicit surfaces , 1994, SIGGRAPH.

[9]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[10]  James F. Blinn,et al.  A Generalization of Algebraic Surface Drawing , 1982, TOGS.

[11]  Brian Wyvill,et al.  Introduction to Implicit Surfaces , 1997 .

[12]  Holger Wendland,et al.  Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree , 1995, Adv. Comput. Math..

[13]  Jack J. Dongarra,et al.  A set of level 3 basic linear algebra subprograms , 1990, TOMS.

[14]  Tony Lindeberg,et al.  Scale-Space Theory in Computer Vision , 1993, Lecture Notes in Computer Science.

[15]  Jean-Philippe Thirion,et al.  New feature points based on geometric invariants for 3D image registration , 1996, International Journal of Computer Vision.

[16]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[17]  A. Witkin,et al.  On the Role of Structure in Vision , 1983 .

[18]  James F. O'Brien,et al.  Variational Implicit Surfaces , 1999 .