Generalized B-spline surfaces of arbitrary topology
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Blending, smoothing and interpolation of irregular meshes using N-sided Varady patches
Proceedings of the fifth ACM symposium on Solid modeling and applications
Bezier and B-Spline Techniques
Bezier and B-Spline Techniques
Unified Analysis of Discontinuous Galerkin Methods for Elliptic Problems
SIAM Journal on Numerical Analysis
A finite element method for surface restoration with smooth boundary conditions
Computer Aided Geometric Design
G2 surface modeling using minimal mean-curvature-variation flow
Computer-Aided Design
A general framework for surface modeling using geometric partial differential equations
Computer Aided Geometric Design
Mixed finite element methods for geometric modeling using general fourth order geometric flows
Computer Aided Geometric Design
Discrete surface modelling using partial differential equations
Computer Aided Geometric Design
Surfaces filling polygonal holes with G1 quasi G2 continuity
Machine Graphics & Vision International Journal
Bicubic B-spline blending patches with optimized shape
Computer-Aided Design
A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Technical note: A technical note on the geometric representation of a ship hull form
Computer-Aided Design
| Hi-index | 0.00 |
A shape optimization problem for spline surfaces of arbitrary topology, with curvature continuous and represented by meshes, is considered. The surface is made of bicubic and binonic polynomial patches and it has a fixed boundary and a tangent plane and curvature at each point of the boundary. The optimization criterion has the form of a functional, measuring the surface undulations. A term measuring undulations of the constant parameter curves of the surface parametrization is used to get a well posed problem. Its presence affects the result. After restricting the space, in which the solution is searched, it is possible to eliminate this term. Three numerical algorithms are described, which may be used to optimize surfaces represented by meshes with small or big numbers of vertices. A possibility of imposing constraints contributes to the practical applicability of the construction.