Efficient, fair interpolation using Catmull-Clark surfaces
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Automatic reconstruction of B-spline surfaces of arbitrary topological type
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Exact evaluation of Catmull-Clark subdivision surfaces at arbitrary parameter values
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Displaced subdivision surfaces
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Approximate Boolean operations on free-form solids
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Rapid evaluation of Catmull-Clark subdivision surfaces
Proceedings of the seventh international conference on 3D Web technology
Designing Fair Curves and Surfaces: Shape Quality in Geometric Modeling and Computer-Aided Design
Designing Fair Curves and Surfaces: Shape Quality in Geometric Modeling and Computer-Aided Design
Curve and Surface Fitting: Saint-Malo 1999
Curve and Surface Fitting: Saint-Malo 1999
Proceedings of the conference on Visualization '01
Direct reconstruction of a displaced subdivision surface from unorganized points
Graphical Models - Pacific graphics 2001
GRIN'01 No description on Graphics interface 2001
Catmull-Clark Surface Fitting for Reverse Engineering Applications
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Subdivision Surface Fitting from a Dense Triangle Mesh
GMP '02 Proceedings of the Geometric Modeling and Processing — Theory and Applications (GMP'02)
Subdivision Surface Fitting to a Range of Points
PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
Anisotropic polygonal remeshing
ACM SIGGRAPH 2003 Papers
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Stationary subdivision and multiresolution surface representations
Stationary subdivision and multiresolution surface representations
Trimming for subdivision surfaces
Computer Aided Geometric Design
Automatic and interactive mesh to T-spline conversion
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Computer-Aided Design
Hi-index | 0.00 |
We present a method for scattered data approximation with subdivision surfaces which actually uses the true representation of the limit surface as a linear combination of smooth basis functions associated with the control vertices. This is unlike previous techniques which used only piecewise linear approximations of the limit surface. By this we can assign arbitrary parameterizations to the given sample points, including those generated by parameter correction. We present a robust and fast algorithm for exact closest point search on Loop surfaces by combining Newton iteration and non-linear minimization. Based on this we perform unconditionally convergent parameter correction to optimize the approximation with respect to the L2 metric and thus we make a well-established scattered data fitting technique which has been available before only for B-spline surfaces, applicable to subdivision surfaces. Further we exploit the fact that the control mesh of a subdivision surface can have arbitrary connectivity to reduce the L∞ error up to a certain user-defined tolerance by adaptively restructuring the control mesh. By employing iterative least squares solvers, we achieve acceptable running times even for large amounts of data and we obtain high quality approximations by surfaces with relatively low control mesh complexity compared to the number of sample points. Since we are using plain subdivision surfaces, there is no need for multiresolution detail coefficients and we do not have to deal with the additional overhead in data and computational complexity associated with them.