polygonal set

polygonal set的基本解释

-

多角集

与polygonal set相关的网络例句 [注：此内容来源于网络，仅供参考]

Thirdly, the principal curve and polygonal line algorithm are introduced, and an implementation of polygonal line algorithm based on Quasi-Newton numerical optimization is illustrated. The simulation results show that when this algorithm isused in the detection of curvilinear defects on wafer map, it can converge fast, compute accurately and meet the demand of application of defects pattern analysis, and with the number of line segment increasing, the polygonal line will approximate to the Kegl principal curve.

研究了主曲线、多边形线算法，提出用多边形算法识别弧状缺陷想法，讨论了用拟牛顿法实现该算法的解决方案，针对硅片缺点模式分析中常出现的弧状缺陷，采用该算法进行检测分析，实验结果表明这种算法快速准确，当线段个数或最小距离平方期望值达到一定门限值后，多边形线就已经能够描述弧状缺点集的形状，随着线段个数增加，最小距离平方期望值还在不断下降，最终会收敛到Kegl主曲线。

For an abitrary set X, appropriate order relations on WCL (the set of all weak closure operators), WIN (the set of all weak interior operators), WOU (the set of all weak exterior operators), WB (the set of all weak boundary operators), WD (the set of all weak derived operators), WD*(the set of all weak difference derived operators), WR (the set of all weak remote neighborhood system operators) and WN (the set of all weak neighborhood system operators) can be defined respectively, which make WCL, WIN, WOU, WB, WD, WD*, WR and WN to be complete lattices that are ismorphic to CS(X,CS is the set of all closure systems on X.

证明了可以在WCL(X上的弱闭包算子的全体)、 WIN(X上的弱内部算子的全体)、 WOU (X上的弱外部算子的全体)、 WB (X上的弱边界算子的全体)、WD、 WD*(X上的弱差导算子的全体)、 WR(X上的弱远域系算子的全体)和WN(X上的弱邻域系算子的全体)上定义适当的序关系，使它们成为与CS(X，〖JX-*5[JX*5]同构的完备格其中CS(X是给定集合X上的闭包系统的全体。

The irrational function forms interpolation on a polygonal element with arbitrary nodal distribution was constructed by using mean value coordinates of polygonal elements.

本文采用多边形单元的平均值坐标，构造任意节点分布的多边形单元无理函数形式的插值函数，提出了一种求解微分方程边值问题的多边形有限元方法。

与polygonal set相关的网络解释 [注：此内容来源于网络，仅供参考]

polygonal set：多角集

polygonal number 多角数 | polygonal set 多角集 | polyharmonic equation 多重低方程