Ensuring compatibility of G-continuous surface patches around a nodepoint

The problem of ensuring compatibility of mixed partial derivative vectors of surface patches joining G²-continuously around a common nodepoint is essential in modelling G²-continuous n-sided surfaces. Although the compatibility constraints can be removed by using C² Gregory patches, these patches have singularities at their corner points. This paper presents conditions for ensuring the compatibility of the mixed partial derivative vectors of surface patches joining G²-continuously around a common nodepoint. After investigating the solvability of these compatibility conditions, a new solution method exploiting G³-continuity of surface patches at a common nodepoint is given. Example surfaces based on this solution method are also provided.     

Gregory-type patches bounded by low degree intergral curves for G continuity

G² continuity of free-form surfaces is sometimes very important in engineering applications. The conditions for G² continuity to connect two Bézier patches were studied and methods have been developed to ensure it. However, they have some restrictions on the shapes of patches of the Bézierpatch formulation. Gregory patch is a kind of free-form surface patch which is extended from Bézier patch so that four first derivatives on its boundary curves can be specified without restrictions of the compatibility condition. Several types of Gregory patches have been developed for intergral, rational, and NURBS boundary curves. In this paper, we propose some intergral boundary Gregorytype patches bounded by cubic and quartic curves for G² continuity.     

A modification to the rational boundary Gregory patch

This paper presents a method for modifying the boundary derivatives of rational Bézier patches, preserving their directions at any parameter so as not to affect the G¹ continuity with adjacent patches. This method is applicable to reduce the complexity of rational boundary Gregory patches.     

Shape preserving interpolation by curvature continuous parametric curves

An interpolation scheme for planar curves is described, obtained by patching together parametric cubic segments and straight lines. The scheme has, in general, geometric continuity of order 2 (G² continuity) and is similar in approach to that of [Goodman & Unsworth ′86], but whereas this earlier scheme, when applied to cubics, produces curves with zero curvature at the interpolation points, the corresponding curvature values in this scheme are in general non-zero. The choice of a tangent vector at each interpolation point guarantees that the interpolating curve is local convexity preserving, and in the case of functional data it is single-valued and local monotonicity preserving. The algorithm for generating the cubic curve segments usually requires the solution of two non-linear equations in two unknowns, and lower bounds are obtained on the magnitude of the curvature at the relevant interpolation points in order that this system of equations has a unique solution. Particular attention is given to cubic segments which are adjacent to straight line segments. Two methods for calculating these segments are described, one which preserves G² continuity, and one which only gives G¹ continuity. A number of examples of the application of the scheme are presented.     

Hermite interpolation with a pair of spirals

The Hermite interpolation problem in the plane considered here is to join two points and to match given unit tangent vectors and signed curvatures at the two points with various G² curves consisting of a pair of spirals. The rotation of the tangent vector of the interpolating curve from one point to the other is restricted to being less than π. The necessary and sufficient conditions for the existence of each of the various curves are given.     

Local surface interpolation with Bézier patches

A surface interpolation method for meshes of cubic curves is described. A mesh of cubic curve is constructed between the given vertices. This mesh is filled with Bézier patches, so that the surface is represented as a union of geometrically continuous bicubic quadrilateral and/or quartic triangular Bézier patches. The method is local and uses Farin's [Farin '83] conditions of G¹ continuity between patches. The procedure for finding the needed control points of the Bézier patches is simple and efficient.     

The singular cases for γ-spline interpolation

We derive a natural extension of Boehm's free-form γ-spline, the G² interpolating γ-spline. Primarily, the conditions under which singularities in the spline formulation occur are investigated. Also, the effect that these singularities have on the interpolant are studied. Comparisons are made to the behavior of the interpolating ν-spline.     

Algorithms of discretization of algebraic spatial curves on homogeneous cubical grids

In this paper new methods of discretization (integer approximation) of algebraic spatial curves in the form of intersecting surfaces P(x, y, z) = 0 and Q(x, y, z) = 0 are analyzed.

The use of homogeneous cubical grids G(h³) to discretize a curve is the essence of the method. Two new algorithms of discretization (on 6-connected grid G_6c(h³) and 26-connected grid G₂₆(h³)) are presented based on the method above. Implementation of the algorithms for algebraic spatial curves is suggested. The elaborated algorithms are adjusted for application in computer graphics and numerical control of machine tools.     

Approximate G continuous interpolation of a rectangular network of rational cubic curves

The problem of spanning a rectangular network of rational cubic curves with a smooth surface is discussed in this paper. Provided the network is compatible with a smooth surface, then algorithms for patch construction, optimization and subdivision are developed to construct an ‘approximately smooth’ surface, that is, G¹ continuous to within some tolerance, composed of rational bicubic patches. The algorithms have been applied in the die and mould industry. The toolmaker constructs a wireframe model of an EDM (electro-discharge machining) electrode and the algorithms automatically construct the surface model. For toolmaking companies, this simplifies the surface modelling process making a highly-specialized and time-consuming task virtually automatic.     

稀疏三角网格模型的Gregory曲面光顺插值

稀疏网格模型精细光顺重建时,网格顶点的法曲率不一致问题仍没有解决,导致渲染阴影。通过推导获得四次三角域Gregory顶点拼接处法曲率变化一致的约束条件,并基于该约束条件对稀疏三角网格模型进行精细重建。重建后的模型不但保证所有相邻三角Gregory曲面片G¹光顺连续,而且拼接顶点处的法曲率变化最小,从而可获得高质量的视觉效果。实验结果验证了在只有原始模型1%~2%网格数目的情况下可获得光顺的视觉渲染效果,结果模型亦具有高精细特征。     

Theories of contact specified by connection matrices

We begin by characterizing notions of geometric continuity represented by connection matrices. Next we present a set of geometric properties that must be satisfied by all reasonable notions of geometric continuity. These geometric requirements are then reinterpreted as an equivalent collection of algebraic constraints on corresponding sets of connection matrices. We provide a general technique for constructing sets of connection matrices satisfying these criteria and apply this technique to generate many examples of novel notions of geometric continuity. Using these constraints and construction techniques, we show that there is no notion of geometric continuity between reparametrization continuity of order 3, (G³), and Frenet frame continuity of order 3, (F³); that there are several notions of geometric continuity between G⁴ and F⁴; and that the number of different notions of geometric continuity between Gⁿ and Fⁿ grows at least exponentially with n.     

Generating the Bézier points of a β-spline curve

We present an efficient algorithm for computing the Bézier points of a generalized cubic β-spline curve and show the connection with multiple knot insertion. We also consider the inverse problem of determining the β-spline vertices of a composite G² Bézier curve. Finally, we briefly discuss how to construct the Bézier net of a tensor product β-spline surface.     

On Stieltjes functions and Hankel operators

Let G be a Stieltjes function which is analytic in the open right half plane. It is shown that G is in H^∞(RHP) if and only if the Hankel operator H_G on H²(RHP) with symbol G is nuclear. If G is in H^∞(RHP) it is shown that the non-tangential limit of G at s = 0 equals twice the nuclear norm of H_G.     

Interpolating G-splines with rational offsets

In (Pottmann, 1995), a geometric characterization of rational PH-curves is presented. Using this result we developed an explicit Bézier representation for interpolating G¹-Hermite PH-splines referring to local coordinate systems. Furthermore a simple geometric criterion for avoiding singularities is proposed.     

High accuracy geometric Hermite interpolation

We describe a parametric cubic spline interpolation scheme for planar curves which is based on an idea of Sabin for the construction of C¹ bicubic parametric spline surfaces. The method is a natural generalization of [standard] Hermite interpolation. In addition to position and tangent, the curvature is prescribed at each knot. This ensures that the resulting interpolating piecewise cubic curve is twice continuously differentiable with respect to arclength and can be constructed locally. Moreover, under appropriate assumptions, the interpolant preserves convexity and is 6-th order accurate.     

Shape aware normal interpolation for curved surface shading from polyhedral approximation

Independent interpolation of local surface patches and local normal patches is an efficient way for fast rendering of smooth curved surfaces from rough polyhedral meshes. However, the independently interpolating normals may deviate greatly from the analytical normals of local interpolating surfaces, and the normal deviation may cause severe rendering defects when the surface is shaded using the interpolating normals. In this paper we propose two novel normal interpolation schemes along with interpolation of cubic Bézier triangles for rendering curved surfaces from rough triangular meshes. Firstly, the interpolating normal is computed by a Gregory normal patch to each Bézier triangle by a new definition of quadratic normal functions along cubic space curves. Secondly, the interpolating normal is obtained by blending side-vertex normal functions along side-vertex parametric curves of the interpolating Bézier surface. The normal patches by these two methods can not only interpolate given normals at vertices or boundaries of a triangle but also match the shape of the local interpolating surface very well. As a result, more realistic shading results are obtained by either of the two new normal interpolation schemes than by the traditional quadratic normal interpolation method for rendering rough triangular meshes.     

An approximate A algorithm and its application to the SCS problem

In this paper we deal with algorithm A^* and its application to the problem of finding the shortest common supersequence of a set of sequences. A^* is a powerful search algorithm which may be used to carry out concurrently the construction of a network and the solution of a shortest path problem on it. We prove a general approximation property of A^* which, by building a smaller network, allows us to find a solution with a given approximation ratio. This is particularly useful when dealing with large instances of some problem. We apply this approach to the solution of the shortest common supersequence problem and show its effectiveness.     

Bivariate hermite subdivision

A subdivision scheme for constructing smooth surfaces interpolating scattered data in R³ 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 {(x_i, y_i)}_i=1^N from which none of the pairs (x_i,y_i) and (x_j,y_j) with i≠j coincide, it is proved that the resulting surface (function) is C¹. 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 C² if the data are not ‘too irregular’. Finally the approximation properties of the methods are investigated.     

Local cubic and bicubic C surface interpolation with linearly varying boundary normal

An algorithm for the interpolation of a ‘mesh of points’ in 3-space by a C¹ surface is developed. At each point, the surface normal can be specified. The surface is constructed locally and consists of cubic and bicubic patches to match the underlying mesh facets. The surface construction is special in that it generates a piecewise parametric surface such that the normal along patch boundaries varies linearly.     

双五次B-样条曲面的G2连续条件

引言 Coons曲面,B6zier曲面和B一样条(包括NURBs)曲面等参数曲面的构造是几何造型和CAD/CAM领域的基础问题.B一样条曲面由于它的局部支集和全局逼近性质已成为这些领域最为常用的几何表示方法.特别是近年来反向工程的发展,使得B一样条的研究越发受到重视.反向工程的关键问题之一是复杂曲面的重建,但是目