Matrix analysis
Universal approximation using radial-basis-function networks
Neural Computation
Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Proceedings of the sixth ACM symposium on Solid modeling and applications
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Modelling with implicit surfaces that interpolate
ACM Transactions on Graphics (TOG)
Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Fast Surface Reconstruction Using the Level Set Method
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Multi-Scale Reconstruction of Implicit Surfaces with Attributes from Large Unorganized Point Sets
SMI '04 Proceedings of the Shape Modeling International 2004
Interpolating and approximating implicit surfaces from polygon soup
ACM SIGGRAPH 2004 Papers
Hi-index | 0.00 |
In this paper, we propose a new method for surface reconstruction from scattered point set based on least square radial basis function (LSRBF) and orthogonal least square forward selection procedure. Firstly, the traditional RBF formulation is rewritten into least square formula. A implicit surface can be represented with fewer centers. Then, the orthogonal least square procedure is utilized to select significant centers from original point data set. The RBF coefficients can be solved from the triangular matrix from OLS selection through backward substitution method. So, this scheme can offer a fast surface reconstruction tool and can overcome the numerical ill-conditioning of coefficient matrix and over-fitting problem. Some examples are presented to show the effectiveness of our algorithm in 2D and 3D cases.