This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bezier surfaces. Examples are provided to illustrate the process of construction and comparison is made...This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bezier 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 Bezier surfaces and improve the algorithm for computing the bounding cone of a set of vectors. [ABSTRACT FROM AUTHOR]展开更多
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...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.展开更多
Partial differential equation-based(PDE-based) surface design generates surfaces from PDEs with given boundary conditions. In this paper, design of triangular Bézier surfaces satisfying triharmonic equations is p...Partial differential equation-based(PDE-based) surface design generates surfaces from PDEs with given boundary conditions. In this paper, design of triangular Bézier surfaces satisfying triharmonic equations is presented. We propose three sets of boundary control points for triharmonic triangular Bézier surfaces design by solving the systems of the linear equations with unique solutions. Moreover, we compare these three methods by some representative examples.展开更多
Degree reduction of parametric curves and surfaces is an important process in the exchange of product model data between various CAD systems. In this paper the degenerate conditions of triangular Bezier surface patch...Degree reduction of parametric curves and surfaces is an important process in the exchange of product model data between various CAD systems. In this paper the degenerate conditions of triangular Bezier surface patches are derived. The degenerate conditions and constrained optimization methods are used to develop a degree reduction method for triangular Bezier surface patches. The error in the degree reduction of a triangular Bezier surface is also shown to depend on some geometric invariants which decrease exponentially in the subdivision process. Therefore, the degree reduction method can be combined with a subdivision algorithm to generate lower degree approximations which are within some preset error tolerance.展开更多
This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials...This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials and Jacobi polynomials, we naturally deduce a novel algorithm for multi-degree reduction of triangular B^zier surfaces. This algorithm possesses four characteristics： ability of error forecast, explicit expression, less time consumption, and best precision. That is, firstly, whether there exists a multi-degree reduced surface within a prescribed tolerance is judged beforehand; secondly, all the operations of multi-degree reduction are just to multiply the column vector generated by sorting the series of the control points of the original surface in lexicographic order by a matrix; thirdly, this matrix can be computed at one time and stored in an array before processing degree reduction; fourthly, the multi-degree reduced surface achieves an optimal approximation in the norm L2. Some numerical experiments are presented to validate the effectiveness of this algorithm, and to show that the algorithm is applicable to information processing of products in CAD system.展开更多
In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） a...In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） algorithm. If the ray pierces the patch only once, we locate the parametric value of the intersection to a smaller triangular domain, which is determined by pairs of lines and quadratic curves, by using a multi-degree reduction method. The triangular domain is iteratively clipped into a smaller one by combining a subdivision method, until the domain size reaches a prespecified threshold. When the ray intersects the patch more than once, Descartes＇ rule of signs and a split step are required to isolate the intersection points. The algorithm can be proven to clip the triangular domain with a cubic convergence rate after an appropriate preprocessing procedure. The proposed algorithm has many attractive properties, such as the absence of an initial guess and insensitivity to small changes in coefficients of the original problem. Experiments have been conducted to illustrate the efficacy of our method in solving ray-triangular Bezier patch intersection problems.展开更多
基金NKBRSF on Mathematics Mechanics! (grant G1998030600)the National Natural Science Foundation of China! (grants 69603009 and 1
文摘This paper describes practical approaches on how to construct bounding pyramids and bounding cones for triangular Bezier 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 Bezier surfaces and improve the algorithm for computing the bounding cone of a set of vectors. [ABSTRACT FROM AUTHOR]
基金Supported by the National Natural Science Foundation of China (6087311160933007)
文摘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.
基金Supported by the National Natural Science Foundation of China(Grant Nos.12071057,11671068).
文摘Partial differential equation-based(PDE-based) surface design generates surfaces from PDEs with given boundary conditions. In this paper, design of triangular Bézier surfaces satisfying triharmonic equations is presented. We propose three sets of boundary control points for triharmonic triangular Bézier surfaces design by solving the systems of the linear equations with unique solutions. Moreover, we compare these three methods by some representative examples.
文摘Degree reduction of parametric curves and surfaces is an important process in the exchange of product model data between various CAD systems. In this paper the degenerate conditions of triangular Bezier surface patches are derived. The degenerate conditions and constrained optimization methods are used to develop a degree reduction method for triangular Bezier surface patches. The error in the degree reduction of a triangular Bezier surface is also shown to depend on some geometric invariants which decrease exponentially in the subdivision process. Therefore, the degree reduction method can be combined with a subdivision algorithm to generate lower degree approximations which are within some preset error tolerance.
基金Supported by the National Grand Fundamental Research 973 Program of China (Grant No. 2004CB719400)the National Natural Science Foun-dation of China (Grant Nos. 60673031 and 60333010)the National Natural Science Foundation for Innovative Research Groups (Grant No. 60021201)
文摘This paper introduces the algebraic property of bivariate orthonormal Jacobi polynomials into geometric approximation. Based on the latest results on the transformation formulae between bivariate Bernstein polynomials and Jacobi polynomials, we naturally deduce a novel algorithm for multi-degree reduction of triangular B^zier surfaces. This algorithm possesses four characteristics： ability of error forecast, explicit expression, less time consumption, and best precision. That is, firstly, whether there exists a multi-degree reduced surface within a prescribed tolerance is judged beforehand; secondly, all the operations of multi-degree reduction are just to multiply the column vector generated by sorting the series of the control points of the original surface in lexicographic order by a matrix; thirdly, this matrix can be computed at one time and stored in an array before processing degree reduction; fourthly, the multi-degree reduced surface achieves an optimal approximation in the norm L2. Some numerical experiments are presented to validate the effectiveness of this algorithm, and to show that the algorithm is applicable to information processing of products in CAD system.
基金Project supported by the National Natural Science Foundation of China （Nos. 61100105, 61572020, and 61472332）, the Natural Science Foundation of Fujian Province of China （No. 2015J01273）, and the Fundamental Research Funds for the Central Universities, China （Nos. 20720150002 and 20720140520）
文摘In this paper, we present a novel geometric method for efficiently and robustly computing intersections between a ray and a triangular Bezier patch defined over a triangular domain, called the hybrid clipping （HC） algorithm. If the ray pierces the patch only once, we locate the parametric value of the intersection to a smaller triangular domain, which is determined by pairs of lines and quadratic curves, by using a multi-degree reduction method. The triangular domain is iteratively clipped into a smaller one by combining a subdivision method, until the domain size reaches a prespecified threshold. When the ray intersects the patch more than once, Descartes＇ rule of signs and a split step are required to isolate the intersection points. The algorithm can be proven to clip the triangular domain with a cubic convergence rate after an appropriate preprocessing procedure. The proposed algorithm has many attractive properties, such as the absence of an initial guess and insensitivity to small changes in coefficients of the original problem. Experiments have been conducted to illustrate the efficacy of our method in solving ray-triangular Bezier patch intersection problems.
