Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Direct surface extraction from 3D freehand ultrasound images
Proceedings of the conference on Visualization '02
Smooth surface reconstruction from noisy range data
Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Overlapping domain decomposition method by radial basis functions
Applied Numerical Mathematics
In memoriam: William Allan light (1950-2002)
Journal of Approximation Theory
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Approximating and intersecting surfaces from points
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Convergence of general meshless Schwarz method using radial basis functions
Applied Numerical Mathematics
Mean value coordinates for arbitrary planar polygons
ACM Transactions on Graphics (TOG)
Multi-level partition of unity implicits
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
A matrix decomposition RBF algorithm: Approximation of functions and their derivatives
Applied Numerical Mathematics
Large-scale RLSC learning without agony
Proceedings of the 24th international conference on Machine learning
A note on the meshless method using radial basis functions
Computers & Mathematics with Applications
An experimental evaluation of non-rigid registration techniques on Quickbird satellite imagery
International Journal of Remote Sensing
Scattered data reconstruction by regularization in B-spline and associated wavelet spaces
Journal of Approximation Theory
Generalizing the bias term of support vector machines
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computers & Mathematics with Applications
Multiquadric collocation method with integralformulation for boundary layer problems
Computers & Mathematics with Applications
Application of the RBF meshless method to the solution of the radiative transport equation
Journal of Computational Physics
A system for reconstruction of solid models from large point clouds
Machine Graphics & Vision International Journal
Scattered data interpolation and approximation for computer graphics
ACM SIGGRAPH ASIA 2010 Courses
Sketching Variational Hermite-RBF implicits
Proceedings of the Seventh Sketch-Based Interfaces and Modeling Symposium
Better bases for radial basis function interpolation problems
Journal of Computational and Applied Mathematics
Orthogonal least square RBF based implicit surface reconstruction methods
VSMM'06 Proceedings of the 12th international conference on Interactive Technologies and Sociotechnical Systems
Preconditioning for radial basis functions with domain decomposition methods
Mathematical and Computer Modelling: An International Journal
A Fast Treecode for Multiquadric Interpolation with Varying Shape Parameters
SIAM Journal on Scientific Computing
Stable Evaluation of Gaussian Radial Basis Function Interpolants
SIAM Journal on Scientific Computing
A robust method of thin plate spline and its application to DEM construction
Computers & Geosciences
Adaptive volume construction from ultrasound images of a human heart
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
A meshless interpolation algorithm using a cell-based searching procedure
Computers & Mathematics with Applications
Hi-index | 0.01 |
In this paper we consider domain decomposition methods for solving the radial basis function interpolation equations. There are three interwoven threads to the paper. The first thread provides good ways of setting up and solving small- to medium-sized radial basis function interpolation problems. These may occur as subproblems in a domain decomposition solution of a larger interpolation problem. The usual formulation of such a problem can suffer from an unfortunate scale dependence not intrinsic in the problem itself. This scale dependence occurs, for instance, when fitting polyharmonic splines in even dimensions. We present and analyze an alternative formulation, available for all strictly conditionally positive definite basic functions, which does not suffer from this drawback, at least for the very important example previously mentioned. This formulation changes the problem into one involving a strictly positive definite symmetric system, which can be easily and efficiently solved by Cholesky factorization. The second section considers a natural domain decomposition method for the interpolation equations and views it as an instance of von Neumann's alternating projection algorithm. Here the underlying Hilbert space is the reproducing kernel Hilbert space induced by the strictly conditionally positive definite basic function. We show that the domain decomposition method presented converges linearly under very weak nondegeneracy conditions on the possibly overlapping subdomains. The last section presents some algorithmic details and numerical results of a domain decomposition interpolatory code for polyharmonic splines in 2 and 3 dimensions. This code has solved problems with 5 million centers and can fit splines with 10,000 centers in approximately 7 seconds on very modest hardware.