Journal Article10.1016/J.GMOD.2005.01.003
Optimization methods for scattered data approximation with subdivision surfaces
Martin Marinov,Leif Kobbelt +1 more
- 01 Sep 2005
- Vol. 67, Iss: 5, pp 452-473
TL;DR: A robust and fast algorithm for exact closest point search on Loop surfaces which combines Newton iteration and non-linear minilnization is used for parameterizing the samples, and thus a well-established scattered data fitting technique is made.
read more
Abstract: 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. A robust and fast algorithm for exact closest point search on Loop surfaces which combines Newton iteration and non-linear minilnization is used for parameterizing the samples. 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. We also adapt the recently discovered local second order squared distance function approximant to the parameter correction setup. Further we exploit the fact that the control mesh of a subdivision surface can have arbitrary connectivity to reduce the L2 error up to a certain user-defined tolerance by adaptively restructuring the control mesh. Combining the presented algorithms we describe a complete procedure which is able to produce high-quality approximations of complex, detailed models.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Template-Based 3D Model Fitting Using Dual-Domain Relaxation
TL;DR: The usefulness of the template fitting method to the application of consistent surface parameterization (also known as cross-parameterization) is demonstrated and the method is shown to encourage near-equilateral mesh elements and significantly reduces the occurrence of triangle foldovers.
Direct reconstruction of displaced subdivision surface from unorganized points
Won-Ki Jeong,Chang-Hun Kim +1 more
- 01 Jan 2001
TL;DR: A new mesh reconstruction algorithm that produces a displaced subdivision mesh directly from unorganized points during the mesh reconstruction process, and suggests a surface detail sampling scheme that determines a valid sampling triangle which can be made with combinations of input points.
43
Large scattered data interpolation with radial basis functions and space subdivision
Michal Smolik,Vaclav Skala +1 more
TL;DR: The proposed RBF interpolation was tested on both synthetic and real data sets and proved its simplicity, robustness and the ability to handle large data sets together with significant speed-up.
39
Cuckoo Search Algorithm with Lévy Flights for Global-Support Parametric Surface Approximation in Reverse Engineering
Andrés Iglesias,Akemi Gálvez,Patricia Suárez,Mikio Shinya,Norimasa Yoshida,César Otero,Cristina Manchado,Valentin Gomez-Jauregui +7 more
TL;DR: This paper addresses the general problem of global-support parametric surface approximation from clouds of data points for reverse engineering applications and performs very well even for the cases of noisy and unorganized data points.
39
Generative Design Conversion to Editable and Watertight Boundary Representation
Marinov Martin Cvetanov,Amagliani Marco,Barback Tristan Ward,Jean Flower,Stephen Alan Barley,Suguru Furuta,Peter Charrot,Iain Edward Henley,Nanda Santhanam,G. Thomas Finnigan,Siavash Navadeh Meshkat,Justin Nicholas Hallet,Maciej Sapun,Pawel Wolski +13 more
TL;DR: This work presents the first, to their knowledge, fully automatic method for the conversion of a general generative design to a watertight B-Rep composed of the exact residual geometry of the input solids and editable T-NURCC surfaces.
34
References
Surface simplification using quadric error metrics
Michael Garland,Paul S. Heckbert +1 more
- 03 Aug 1997
TL;DR: This work has developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models, and which also supports non-manifold surface models.
•Book
Algorithms for Minimization Without Derivatives
Richard P. Brent
- 01 Jan 1972
TL;DR: In this paper, a monograph describes and analyzes some practical methods for finding approximate zeros and minima of functions, and some of these methods can be used to find approximate minima as well.
Algorithms for minimization without derivatives
TL;DR: This monograph describes and analyzes some practical methods for finding approximate zeros and minima of functions.
2.5K
Recursively generated B-spline surfaces on arbitrary topological meshes
Ed Catmull,J. Clark +1 more
TL;DR: The method is presented as a generalization of a recursive bicubic B-spline patch subdivision algorithm, which generates surfaces that approximate points lying-on a mesh of arbitrary topology except at a small number of points, called extraordinary points.
2.3K
Discrete Differential-Geometry Operators for Triangulated 2-Manifolds
Mark Meyer,Mathieu Desbrun,Mathieu Desbrun,Peter Schröder,Alan H. Barr +4 more
- 01 Jan 2003
TL;DR: A unified and consistent set of flexible tools to approximate important geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes, using averaging Voronoi cells and the mixed Finite-Element/Finite-Volume method is proposed.