2,301 research outputs found
Curve network interpolation by quadratic B-spline surfaces
In this paper we investigate the problem of interpolating a B-spline curve
network, in order to create a surface satisfying such a constraint and defined
by blending functions spanning the space of bivariate quadratic splines
on criss-cross triangulations. We prove the existence and uniqueness of the
surface, providing a constructive algorithm for its generation. We also present
numerical and graphical results and comparisons with other methods.Comment: With respect to the previous version, this version of the paper is
improved. The results have been reorganized and it is more general since it
deals with non uniform knot partitions. Accepted for publication in Computer
Aided Geometric Design, October 201
Recommended from our members
Smooth parametric surfaces and n-sided patches
The theory of 'geometric continuity' within the subject of CAGD is reviewed. In particular, we are concerned with how parametric surface patches for CAGD can be pieced together to form a smooth Ck surface. The theory is applied to the problem of filling an n-sided hole occurring within a smooth rectangular patch complex. A number of solutions to this problem are surveyed
Quadratic B-Spline Surfaces with Free Parameters for the Interpolation of Curve Networks
In this paper, we propose a method for constructing spline surfaces interpolating a B-spline curve network, allowing the presence of free parameters, in order to model the interpolating surface. We provide a constructive algorithm for its generation in the case of biquadratic tensor product B-spline surfaces and bivariate B-spline surfaces on criss-cross triangulations. Finally, we present graphical results
Bivariate Hermite subdivision
A subdivision scheme for constructing smooth surfaces interpolating scattered data in is proposed. It is also possible to impose derivative constraints in these points. In the case of functional data, i.e., data are given in a properly triangulated set of points from which none of the pairs and with coincide, it is proved that the resulting surface (function) is . The method is based on the construction of a sequence of continuous splines of degree 3. Another subdivision method, based on constructing a sequence of splines of degree 5 which are once differentiable, yields a function which is if the data are not 'too irregular'. Finally the approximation properties of the methods are investigated
Flexible G1 Interpolation of Quad Meshes
International audienceTransforming an arbitrary mesh into a smooth G1 surface has been the subject of intensive research works. To get a visual pleasing shape without any imperfection even in the presence of extraordinary mesh vertices is still a challenging problem in particular when interpolation of the mesh vertices is required. We present a new local method, which produces visually smooth shapes while solving the interpolation problem. It consists of combining low degree biquartic Bézier patches with minimum number of pieces per mesh face, assembled together with G1-continuity. All surface control points are given explicitly. The construction is local and free of zero-twists. We further show that within this economical class of surfaces it is however possible to derive a sufficient number of meaningful degrees of freedom so that standard optimization techniques result in high quality surfaces
Recursive subdivision algorithms for curve and surface design
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, the author studies recursIve subdivision algorithms for curves and surfaces. Several subdivision algorithms are constructed and investigated. Some graphic examples are also presented.
Inspired by the Chaikin's algorithm and the Catmull-Clark's algorithm, some non-uniform schemes, the non-uniform corner cutting scheme and the recursive subdivision algorithm for non-uniform B-spline curves, are constructed and analysed. The adapted parametrization is introduced to analyse these non-uniform algorithms. In order to solve the surface interpolation problem, the Dyn-Gregory-Levin's 4-point interpolatory scheme is generalized to surfaces and the 10-point interpolatory subdivision scheme for surfaces is formulated. The so-called Butterfly Scheme, which was firstly introduced by Dyn, Gregory Levin in 1988, is just a special case of the scheme. By studying the Cross-Differences of Directional Divided Differences, a matrix approach for analysing uniform subdivision algorithms for surfaces is established and the convergence of the 10-point scheme over both uniform and non-uniform triangular networks is studied. Another algorithm, the subdivision algorithm for uniform bi-quartic B-spline surfaces over arbitrary topology is introduced and investigated. This algorithm is a generalization of Doo-Sabin's and Catmull-Clark's algorithms. It produces uniform Bi-quartic B-spline patches over uniform data. By studying the local subdivision matrix, which is a circulant, the tangent plane and curvature properties of the limit surfaces at the so-called Extraordinary Points are studied in detail.The Chinese Educational Commission and The British Council (SBFSS/1987
Implicitization of curves and (hyper)surfaces using predicted support
We reduce implicitization of rational planar parametric curves and (hyper)surfaces to linear algebra, by interpolating the coefficients of the implicit equation.
For predicting the implicit support, we focus on methods that exploit input and output structure in the sense of sparse (or toric) elimination theory, namely by computing the Newton polytope of the implicit polynomial, via sparse resultant theory.
Our algorithm works even in the presence of base points but, in this case, the implicit equation shall be obtained as a factor of the produced polynomial.
We implement our methods on Maple, and some on Matlab as well, and study their numerical stability and efficiency on several classes of curves and surfaces.
We apply our approach to approximate implicitization,
and quantify the accuracy of the approximate output,
which turns out to be satisfactory on all tested examples; we also relate our measures to Hausdorff distance.
In building a square or rectangular matrix, an important issue is (over)sampling the given curve or surface: we conclude that unitary complexes offer the best tradeoff between speed and accuracy when numerical methods are employed, namely SVD, whereas for exact kernel computation random integers is the method of choice.
We compare our prototype to existing software and find that it is rather competitive
- …