Bézier曲线曲面正则性的判别条件

正则性是参数曲线曲面的重要代数性质,是由参数曲线曲面的参数化决定的.在计算机辅助制造过程中,要求所处理的参数曲线曲面是正则的,前提是计算机辅助设计得到的参数曲线曲面是正则曲线曲面.然而,直接按照正则参数曲线曲面的定义,采用解方程或方程组的方法来判断曲线曲面是否正则,其计算相当复杂,实际上也是行不通的.通过将Bézier曲线曲面的导矢曲线(法矢曲面)的参数表示转换为隐式表示,得到了一个判断Bézier曲线曲面正则性的简单而实用的充分条件.     

一类四次隐式代数曲面参数化研究

隐式代数曲面的参数化是 CAGD的热点问题之一 .针对一类四次隐式代数曲面 ,提出一种基于分片的几何参数化方法 .首先对四次代数曲面进行分片 ,然后对每一个分片曲面利用一组同轴平面束与其求交线 ,通过对求得交线的参数化来完成对整个分片曲面的参数化 .该方法是一种精确的参数化方法 ,其结构直观、计算简单 ,并且具有可使分片的四次代数曲面位于 [0 ,1]× [0 ,1]参数区间内 ,以及分片曲面的边界位于等参数线上等特点 ,利用该参数曲面可以方便地实现机器作图和几何操作 .实验结果验证了文中方法的有效性 .     

三角网格上五次齐次代数曲面的重构

提出三角网格上重建代数曲面的一种方法,利用三次控制曲面来构造五次具有"齐次"形式的GC<'1>光滑曲面,所构造的代数曲面具有2次精度、局部性好、计算量低、自由参数几何意义明确的优点;而且这个五次代数曲面在与一簇特殊的平面相交时,交线为一个四次代数曲线和一条直线,从而化简了这类曲面参数化的计算量.     

构造多管道过渡曲面的toric曲面方法

针对多个圆锥曲面管道,提出了利用2片toric曲面构造管道过渡曲面的方法.首先根据管道的几何特征确定多边形参数域,对参数域进行正则分解;然后借助toric曲面的退化理论与有理Bézier曲面间的几何拼接条件,给出过渡曲面G1连续时toric曲面控制顶点所需满足的几何条件.文中方法不需求解方程组,具有一定的灵活性.最后通过具体实例证明了该方法的有效性.     

一类三次隐式代数曲面参数化研究

在CAGD中隐式曲面和参数曲面作为曲面的两种表示形式各有其内在的优点 ,多年来如何有效地实现二者的相互转换一直是CAGD的一个热点问题 对一类GC1拼接两个二次曲面的三次混合代数曲面进行了研究 ,提出一种基于同轴平面束与代数曲面相交的几何化参数化方法 与传统参数化方法相比 ,该方法结构直观且具有可使三次代数曲面位于 [0 ,1]× [0 ,1]参数区间内 ,以及曲面的边界位于等参数线上等特点 ,利用这种参数曲面可以方便地实现机器作图和各种操作 实验结果验证了方法的有效性     

构造代数Blending曲面的Gr bner基方法

利用代数几何中关于理想的 Gr bner基的理论 ,结合 CAGD中的研究方法 ,对代数 Blending曲面做了较为细致的研究 ,给出了用 Gr bner基构造代数 Blending曲面的新方法 .该方法能够求出所有满足要求的代数Blending曲面 ,并能给出其中次数最低的曲面 .文中还讨论了如何利用代数曲面插值、最小平方逼近的方法来选取合适的自由参数 ,以达到对代数 Blending曲面进行形状控制的目的 .最后给出了一个茶壶表面造型示例 ,以说明方法的有效性     

代数拼接曲面的参数调整

针对代数曲面拼接中存在直接通过符号计算方法得到的拼接曲面有时不能满足实际拼接需求的问题,提出2种对二次曲面的拼接曲面进行调整的方法:1)计算拼接曲面之前,在构造的方程中加入参数,然后利用结式能够对含有参数的代数方程进行消元的性质得到带有参数的过渡曲面,调整参数的值改变从一个曲面过渡到另一个曲面的速度使得曲面形状改变;2)在计算出结式后,通过增加补偿参数或函数使得曲面的形状改变.文中还从理论上分析并证明了这2种方法可以保持原来拼接曲面光滑连续性的阶数.实验结果表明,文中方法具有很强的通用性且易于实现.     

用分片代数曲面构造管道曲面的过渡曲面

借助围绕一个顶点处代数曲面的光滑拼接条件,提出并研究了用分片代数曲面构造三通管道的过渡曲面问题。首先对空间区域进行适当的剖分以确定分片代数曲面的定义区域。然后,通过求解一个线性方程组来构造出光滑拼接的分片代数曲面,同时还了在代数曲面片的Ｂ－Ｂ表示下,Ｂｅｚｉｅｒ纵标对过渡曲面的形状的局部控制问题。结果表明,用分片代数曲面构造过渡曲面不仅可以降低曲面的次数,而且更有利于曲面形状的控制。     

构造代数Blending曲面的Grobner基方法

利用代数几何中关于理想的Groebner基的理论，结合CAGD中的研究方法，对代数Blending曲面做了较为细致的研究，给出了用Groebner基构造代数Blending曲面的新方法，该方法能够求出所有满足要求的代数Blending曲面，并能给出其中次数最低的曲面，文中还讨论了如何利用代数曲面插值，最小平方逼近的方法来选取合适的自由参数，以达到对代数Blending曲面进行形状控制的目的，最后给出了一个茶壶表面造型示例，以说明方法的有效性。     

单帧红外图像低频非均匀性噪声校正算法

红外成像系统中,低频非均匀性噪声严重影响红外系统的成像效果,传统基于标定的方法无法对其进行有效的去除.为此,提出一种基于曲面拟合的低频非均匀性噪声校正算法,首先对含噪图像进行小波滤波,以抑制高频信息;然后利用场景和低频非均匀性噪声梯度的稀疏特性,建立关于非均匀性噪声曲面参数的■正则化能量泛函,并利用ADMM方法求解最优的非均匀性噪声曲面参数;最后将原始图像减去估计的低频非均匀性噪声得到校正后的图像.使用中波红外热像仪拍摄得到红外图像,对仿真图像和实际图像进行校正,实验结果表明,该算法能明显降低图像的粗糙度和非均匀性值,且有效地去除低频非均匀性噪声.     

Surface self-intersection computation via algebraic decomposition

This work draws upon a recent result (Pekerman et al., 2008) [3] on self-intersection detection and elimination for planar curves, which attempted to eliminate redundant algebraic components. We extend this result to surfaces and bivariate functions. An algebraic decomposition is presented that reformulates the surface self-intersection problem using an alternative set of constraints, while removing the redundant components. Extensions to higher dimensions are also briefly discussed.     

代数曲线曲面动态分裂采样方法

提出了基于随机微分方程的动态分裂采样方法,实现了对闭代数曲线曲面的均匀采样,并通过边界盒约束,建立整个空间到边界盒的连续映射实现对开放式代数曲线曲面的均匀采样.该方法最大的特点在于它对拓扑结构复杂(有自交、含两个以上的多分支或不连通)的代数曲线曲面采样同样效果很好.     

Self-intersection detection and elimination in freeform curves and surfaces

We present several algorithms for self-intersection detection, and possible elimination, in freeform planar curves and surfaces. Both local and global self-intersections are eliminated using a binormal-line criterion and a simple direct algebraic elimination procedure that enables the direct solution of the algebraic (self-)intersection constraints.All algorithms have been fully implemented and tested. Examples are presented for applications in self-intersection detection, self-intersection-free metamorphosis of curves, and proper trimming of self-intersections in offset curves.     

Blending Quadric Surfaces with Piecewise Algebraic Surfaces

Given several algebraic surfaces and corresponding auxiliary planes, a scheme for constructing a piecewise algebraic surface to blend the given surfaces is presented along the intersection curves of the given surfaces and their corresponding auxiliary planes. The algorithm starts with the suitable partition of the 3D space into tetrahedrons or prisms in which the algebraic surface patches are defined. Then a smooth piecewise algebraic surface of low degree is constructed which meets the initial surfaces with a certain order of geometric continuity. Examples are provided to demonstrate the detailed construction process and to compare our method with previous approaches. The results show some advantages of the new blending method.     

Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD–CAE integration

Boundary-representation (B-rep) geometrical models, often mathematically represented using Non-Uniform Rational B-Spline (NURBS) surfaces, are the starting point for complex downstream product life-cycle evaluations including Computer-Aided Engineering (CAE). Boolean operations during B-rep model generation require surface intersection computations to describe the composed entity. However, for parametric NURBS surfaces, intersection operations are non-trivial and typically carried out numerically. The numerical intersection computations introduce challenges relating to the accuracy of the resulting representation, efficiency with which the computation is carried out, and robustness of the result to small variations in geometry. Often, for downstream CAE evaluations, an implicit, procedural knowledge of the Boolean operations between the composed objects that can resolve point containment queries (exact to the original NURBS bounding surfaces) maybe sufficient during quadrature. However, common point containment queries on B-rep models are numerical, iterative and relatively expensive. Thus, the first goal of the present paper is to describe a purely algebraic, and therefore non-iterative, approach to carrying out point containment queries on complex B-rep models built using low-degree NURBS surfaces. For CAE operations, the boundary representation of B-rep solids is, in general, not convenient and as a result, the B-rep model is converted to a meshed volumetric approximation. The major challenges to such a conversion include capturing the geometric features accurately when constructing the secondary (meshed) representation, apart from the efficiency of carrying out such a mesh generation step repeatedly as the geometric shape evolves. Thus, an ideal analysis procedure would operate directly on B-rep CAD models, without needing a secondary mesh, and would procedurally unify the geometric operations during CAD as well as CAE stages. Therefore, the second and broader goal of the present paper is to demonstrate CAD–CAE integration using signed algebraic level set operations directly on B-rep models by embedding or immersing the bounding surfaces within a discretized domain while preserving the geometric accuracy of the surfaces exact to the original NURBS representation during analysis.     

A mapping-based approach to eliminating self-intersection of offset paths on mesh surfaces for CNC machining

Geometrically, a tool path can be generated by successively offsetting its adjacent path on the surface with a given path interval, which preferably starts from one of the surface boundaries or a primary curve. The key issues involved in offset path planning are the generation of raw offset paths and the elimination of the self-intersection of raw offset paths. Most researches available in this area are focused on how to generate the raw offset paths, however, the latter, especially how to eliminate the self-intersection of the offset paths on mesh surfaces, has not been sufficiently addressed. In this paper, a mapping-based approach to eliminating the self-intersection of offset paths is proposed for the CNC machining of mesh surfaces. The method first flattens the mesh surface onto a predefined plane by using a mesh mapping technique, and then taking the mapping as a guide, the offset paths are also naturally mapped onto the plane, from which those invalid self-intersection loops can be effectively identified and eliminated. To handle the issue of self-intersection for all types of offset path, a notion of local loop is introduced to detect and eliminate the invalid self-intersection loops. After that the planar paths are inversely mapped into the physical space and the final tool paths used for the machining of mesh surface are obtained. Meanwhile, in order to improve the kinematic and dynamic performance of the machine tool when machining along the generated offset paths, a method for rounding the sharp corners of tool paths, which result from the process of eliminating the self-intersection of raw offset paths, is also preliminarily investigated. Finally, the proposed method is validated by the results of simulations and machining experiments.     

Trimming local and global self-intersections in offset curves/surfaces using distance maps

A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a rational distance map between the original curve or surface and its offset. By solving a bivariate polynomial equation for an offset curve or a system of three polynomial equations for an offset surface, all local and global self-intersection regions in offset curves or surfaces can be detected. The zero-set of polynomial equation(s) corresponds to the self-intersection regions. These regions are trimmed by projecting the zero-set into an appropriate parameter space. The projection operation simplifies the analysis of the zero-set, which makes the proposed algorithm numerically stable and efficient. Furthermore, in a post-processing step, a numerical marching method is employed, which provides a highly precise scheme for self-intersection elimination in both offset curves and surfaces. The effectiveness of our approach is demonstrated using several experimental results.     

Real-time ray casting of algebraic B-spline surfaces

Piecewise algebraic B-spline surfaces (ABS surfaces) are capable of modeling globally smooth shapes of arbitrary topology. These can be potentially applied in geometric modeling, scientific visualization, computer animation and mathematical illustration. However, real-time ray casting the surface is still an obstacle for interactive applications, due to the large amount of numerical root findings of nonlinear polynomial systems that are required. In this paper, we present a GPU-based real-time ray casting method for ABS surfaces. To explore the powerful parallel computing capacity of contemporary GPUs, we adopt iterative numerical root-finding algorithms, e.g., the Newton-Raphson and regula falsi algorithms, rather than recursive ones. To facilitate convergence of the Newton-Raphson or regula falsi algorithm, their initial guesses are determined through rasterization of the isotopic isosurface, and the isosurface is generated based on regular criteria for surface domain subdivision. Meanwhile, polar surfaces are adopted to identify single roots or to isolate different roots, i.e., ray and surface intersections. As an important geometric feature, the silhouette curve is elaborately computed to floating-point accuracy, which can be applied in further anti-aliasing processes. The experimental results show that the proposed method can render thousands of piecewise algebraic surface patches of degrees 6-9 in real time.