An extension of the Bézier model

In this paper, we first construct a new kind of basis functions by a recursive approach. Based on these basis functions, we define the Bézier-like curve and rectangular Bézier-like surface. Then we extend the new basis functions to the triangular domain, and define the Bernstein-Bézier-like surface over the triangular domain. The new curve and surfaces have most properties of the corresponding classical Bézier curve and surfaces. Moreover, the shape parameter can adjust the shape of the new curve and surfaces without changing the control points. Along with the increase of the shape parameter, the new curve and surfaces approach the control polygon or control net. In addition, the evaluation algorithm for the new curve and triangular surface are provided.     

New Trigonometric Basis Possessing Exponential Shape Parameters

Four new trigonometric Bernstein-like basis functions with two exponential shape parameters are constructed, based on which a class of trigonometric Bézier-like curves, analogous to the cubic Bézier curves, is proposed. The corner cutting algorithm for computing the trigonometric Bézier-like curves is given. Any arc of an ellipse or a parabola can be represented exactly by using the trigonometric Bézier-like curves. The corresponding trigonometric Bernstein-like operator is presented and the spectral analysis shows that the trigonometric Bézier-like curves are closer to the given control polygon than the cubic Bézier curves. Based on the new proposed trigonometric Bernstein-like basis, a new class of trigonometric B-spline-like basis functions with two local exponential shape parameters is constructed. The totally positive property of the trigonometric B-spline-like basis is proved. For different values of the shape parameters, the associated trigonometric B-spline-like curves can be $C^2$ ∩ $FC^3$ continuous for a non-uniform knot vector, and $C^3$ or $C^5$ continuous for a uniform knot vector. A new class of trigonometric Bézier-like basis functions over triangular domain is also constructed. A de Casteljau-type algorithm for computing the associated trigonometric Bézier-like patch is developed. The conditions for $G^1$ continuous joining two trigonometric Bézier-like patches over triangular domain are deduced.     

BOUNDING PYRAMIDS AND BOUNDING CONES FOR TRIANGULAR BEZIER SURFACES

1. IntroductionA 6ounding pyramid/cone of a rational B6zier surface patch is a pyramid/cone whichhas the property that if its vertex is translated to any point on the B6zier patch, thepatch will lie completely outside the pyramid/cone. These kinds of pyramids/conesare useful tools in detecting closed loops in surface/surface intersections[2, 3] and determining directions for which a surface is single valued[5]. While methods of finding bounding pyramids and bounding cones for rectangular B6zi…     

Approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces

An attractive method for approximating rational triangular Bézier surfaces by polynomial triangular Bézier surfaces is introduced. The main result is that the arbitrary given order derived vectors of a polynomial triangular surface converge uniformly to those of the approximated rational triangular Bézier surface as the elevated degree tends to infinity. The polynomial triangular surface is constructed as follows. Firstly, we elevate the degree of the approximated rational triangular Bézier surface, then a polynomial triangular Bézier surface is produced, which has the same order and new control points of the degree-elevated rational surface. The approximation method has theoretical significance and application value: it solves two shortcomings-fussy expression and uninsured convergence of the approximation-of Hybrid algorithms for rational polynomial curves and surfaces approximation.     

三角域上带两个形状参数的Bézier曲面的扩展

给出了三角域上带双参数λ1,λ2的类三次Bernstein基函数,它是三角域上三次Bernstein基函数的扩展.分析了该组基的性质并定义了三角域上带有两个形状参数λ1,λ2的类三次Bernstein-Bézier(B-B)参数曲面.该基函数及参数曲面分别具有与三次Bernstein基函数及三次B-B参数曲面类似的性质.当λ1,λ2取特殊的值时,可分别得到三次Bernstein基函数及三次B-B参数曲面以及参考文献中所定义的类三次Bernstein基函数及类三次B-B参数曲面.由实例可知,通过改变形状参数的取值,可以调整曲面的形状.     

Bounding Pyramids and Bounding Cones for Triangular Bézier Surfaces

This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bézier surfaces. Examples are provided to illustrate the process of construction and comparison is made between various surface bounding volumes. Furthermore, as a starting point for the construction, we provide a way to compute hodographs of triangular Bézier surfaces and improve the algorithm for computing the bounding cone of a set of vectors.     

一类时间可逆三次微分系统的代数条件

作者曾给出时间可逆微分系统代数条件推导的算法,并给出了一类时间可逆三次微分系统的系数条件,但其中含有一个实参数.为了消去这个参数,这里使用具有投影性质的三角序列和标准基等消元手段,得到了不含参数的完整代数条件.     

Consistency analysis of triangular fuzzy reciprocal preference relations

In order to simulate the uncertainty associated with impression or vagueness, a decision maker may give her/his judgments by means of triangular fuzzy reciprocal preference relations in the process of decision making. The study of their consistency becomes a very important aspect to avoid a misleading solution. Based on the reciprocity property, this paper proposes a new definition of consistent triangular fuzzy reciprocal preference relations. The new definition is different from that reduced by consistent fuzzy reciprocal preference relations proposed by Buckley (1985). The properties of consistent triangular fuzzy reciprocal preference relations in the light of the new definition are studied in detail. In addition, the shortcomings of the proof procedure of the proposition given by Wang and Chen (2008) are pointed out. And the proposition is reproved by using the new definition of consistent triangular fuzzy reciprocal preference relations. Finally, using the (n − 1) restricted comparison ratios, a method for obtaining consistent triangular fuzzy reciprocal preference relations is proposed, and an algorithm is shown to make a consistent decision ranking. Numerical results are further calculated to illustrate the new definition and the obtained algorithm.     

Triangular domain extension of algebraic trigonometric Bézier-like basis

In computer aided geometric design (CAGD), Bézier-like bases receive more and more considerations as new modeling tools in recent years. But those existing Bézier-like bases are all defined over the rectangular domain. In this paper, we extend the algebraic trigonometric Bézier-like basis of order 4 to the triangular domain. The new basis functions defined over the triangular domain are proved to fulfill non-negativity, partition of unity, symmetry, boundary representation, linear independence and so on. We also prove some properties of the corresponding Bézier-like surfaces. Finally, some applications of the proposed basis are shown.     

Constrained multi-degree reduction of triangular Bézier surfaces

This paper proposes and applies a method to sort two-dimensional control points of triangular Bezier surfaces in a row vector. Using the property of bivariate Jacobi basis functions, it further presents two algorithms for multi-degree reduction of triangular Bezier surfaces with constraints, providing explicit degree-reduced surfaces. The first algorithm can obtain the explicit representation of the optimal degree-reduced surfaces and the approximating error in both boundary curve constraints and corner constraints. But it has to solve the inversion of a matrix whose degree is related with the original surface. The second algorithm entails no matrix inversion to bring about computational instability, gives stable degree-reduced surfaces quickly, and presents the error bound. In the end, the paper proves the efficiency of the two algorithms through examples and error analysis.     

周期B样条基转换矩阵的表示和计算

周期B样条基以一种简洁的形式表示闭B样条曲线.周期B样条基转换矩阵为闭B样条曲线及相关曲面的不同表示间的转换提供了一个数学模型.本文给出了周期B样条基转换矩阵的存在性条件,给出并证明了周期B样条基转换矩阵的一个简单的递归表示式.在此基础上,本文进一步给出了周期B样条基转换矩阵的计算公式和高效算法.周期B样条基转换矩阵为闭B样条曲线的节点插入、升阶、节点删除和降阶等基本运算提供了一个统一而简单的解决方法,本文给出了一些应用例子.     

Triangular Bézier sub-surfaces on a triangular Bézier surface

This paper considers the problem of computing the Bézier representation for a triangular sub-patch on a triangular Bézier surface. The triangular sub-patch is defined as a composition of the triangular surface and a domain surface that is also a triangular Bézier patch. Based on de Casteljau recursions and shifting operators, previous methods express the control points of the triangular sub-patch as linear combinations of the construction points that are constructed from the control points of the triangular Bézier surface. The construction points contain too many redundancies. This paper derives a simple explicit formula that computes the composite triangular sub-patch in terms of the blossoming points that correspond to distinct construction points and then an efficient algorithm is presented to calculate the control points of the sub-patch.     

High‐performance direct algorithms for computing the sign function of triangular matrices

Algorithms and implementations for computing the sign function of a triangular matrix are fundamental building blocks for computing the sign of arbitrary square real or complex matrices. We present novel recursive and cache‐efficient algorithms that are based on Higham's stabilized specialization of Parlett's substitution algorithm for computing the sign of a triangular matrix. We show that the new recursive algorithms are asymptotically optimal in terms of the number of cache misses that they generate. One algorithm that we present performs more arithmetic than the nonrecursive version, but this allows it to benefit from calling highly optimized matrix multiplication routines; the other performs the same number of operations as the nonrecursive version, suing custom computational kernels instead. We present implementations of both, as well as a cache‐efficient implementation of a block version of Parlett's algorithm. Our experiments demonstrate that the blocked and recursive versions are much faster than the previous algorithms and that the inertia strongly influences their relative performance, as predicted by our analysis.     

Meshfree Thinning of 3D Point Clouds

An efficient data reduction scheme for the simplification of a surface given by a large set X of 3D point-samples is proposed. The data reduction relies on a recursive point removal algorithm, termed thinning, which outputs a data hierarchy of point-samples for multiresolution surface approximation. The thinning algorithm works with a point removal criterion, which measures the significances of the points in their local neighbourhoods, and which removes a least significant point at each step. For any point x in the current point set Y⊂X, its significance reflects the approximation quality of a local surface reconstructed from neighbouring points in Y. The local surface reconstruction is done over an estimated tangent plane at x by using radial basis functions. The approximation quality of the surface reconstruction around x is measured by using its maximal deviation from the given point-samples X in a local neighbourhood of x. The resulting thinning algorithm is meshfree, i.e., its performance is solely based upon the geometry of the input 3D surface point-samples, and so it does not require any further topological information, such as point connectivities. Computational details of the thinning algorithm and the required data structures for efficient implementation are explained and its complexity is discussed. Two examples are presented for illustration. This paper is dedicated to Arieh Iserles on the occasion of his 60th anniversary.     

三角域上Bernstein—Bézier曲面的一种推广

本文给出了三角域上Bernstein—Bezier曲面的一种推广,并研究了这种曲面的性质和算法。     

Bit-size estimates for triangular sets in positive dimension

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm.This extends the results by the first and the last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and interpolation techniques. Even though the main tool (height theory) remains the same, new difficulties arise to control the growth of the coefficients during the interpolation process.     

Toeplitz型矩阵的逆矩阵的快速三角分解算法

针对有关“型”矩阵的三角分解问题 ,提出了一种 Toeplitz型矩阵的逆矩阵的快速三角分解算法 .首先假设给定 n阶非奇异矩阵 A,利用一组线性方程组的解 ,得到 A- 1的一个递推关系式 ,进而利用该关系式得到 A- 1的一种三角分解表达式 ,然后从 Toeplitz型矩阵的特殊结构出发 ,利用上述定理的结论 ,给出了Toeplitz型矩阵的逆矩阵的一种快速三角分解算法 ,算法所需运算量为 O( mn2 ) .最后 ,数值计算表明该算法的可靠性 .     

Stability analysis and fast algorithms for triangularization of Toeplitz matrices

Summary. A new algorithm for triangularizing an Toeplitz matrix is presented. The algorithm is based on the previously developed recursive algorithms that exploit the Toeplitz structure and compute each row of the triangular factor via updating and downdating steps. A forward error analysis for this existing recursive algorithm is presented, which allows us to monitor the conditioning of the problem, and use the method of corrected semi-normal equations to obtain higher accuracy for certain ill-conditioned matrices. Numerical experiments show that the new algorithm improves the accuracy significantly while the computational complexity stays in . Received April 30, 1995 / Revised version received February 12, 1996     

Global properties of the triangular systems in the singular case

We introduce a new class of the triangular (multi-input and multi-output) control systems, of O.D.E., which are not feedback linearizable, and investigate its global behavior. The triangular form introduced is a generalization of the classes of triangular systems, considered before. For our class, we solve the problem of global robust controllability. Combining our main result with that of [F.H. Clarke, Yu.S. Ledyaev, E.D. Sontag, A.I. Subbotin, Asymptotic controllability implies feedback stabilization, IEEE Trans. Automat. Control 42 (1997) 1394-1407], we obtain a corollary on the global discontinuous sampled stabilization (an example showing that global smooth stabilization can be irrelevant to the singular case is considered). To prove our main result, we apply a certain “back-stepping” algorithm and combine the technique proposed in [V.I. Korobov, S.S. Pavlichkov, W.H. Schmidt, Global robust controllability of the triangular integro-differential Volterra systems, J. Math. Anal. Appl. 309 (2005) 743-760] with solving a specific problem of global “practical stabilization” by means of a discontinuous, time-varying feedback law.     

On the degree elevation of Bernstein polynomial representation

The polynomials determined in the Bernstein (Bézier) basis enjoy considerable popularity in computer-aided design (CAD) applications. The common situation in these applications is, that polynomials given in the basis of degree n have to be represented in the basis of higher degree. The corresponding transformation algorithms are called algorithms for degree elevation of Bernstein polynomial representations. These algorithms are only then of practical importance if they do not require the ill-conditioned conversion between the Bernstein and the power basis. We discuss all the algorithms of this kind known in the literature and compare them to the new ones we establish. Some among the latter are better conditioned and not more expensive than the currently used ones. All these algorithms can be applied componentwise to vector-valued polynomial Bézier representations of curves or surfaces.