1) convexifying algorithm
凸化算法
2) convex hull algorithm
凸壳算法
3) convex hull algorithm
凸包算法
1.
The modeling method firstly established face model by using a considering bench attribute Delaunay TIN convex hull algorithm,then sets up the mining solid model by strengthening region and using solid Boolean operation.
本文在AutoCAD平台下,以钻孔信息、剖面图和空间离散点为基础数据,采用顾及台阶属性的Delaunay三角网凸包算法建立界面模型,通过面域拉伸和实体布尔运算等方法生成三维实体模型。
2.
The author proposed a new rotating coordinates convex hull algorithm, and using it in assessing roundness to reduce the computation.
提出了一种新的基于坐标旋转的凸包算法,并将其运用在对圆度误差的最小外接圆评定算法中,减小计算量。
3.
The modeling method firstly established face model by using a considering bench attribute Delaunay TIN convex hull algorithm,then sets up the mining solid model by strengthening region and using solid Boolean operation.
在AutoCAD平台下,以钻孔信息、剖面图和空间离散点为基础数据,采用顾及台阶属性的Delaunay三角网凸包算法建立界面模型,通过面域拉伸和实体布尔运算等方法生成三维实体模型。
5) convex combination algorithm
凸组合算法
1.
Then the single level optimization problem is solved iteratively by convex combination algorithm with predetermined step size.
利用罚函数思想和最优值函数的概念将混合整数双层规划转化为连续变量的单层非线性规划,然后用事先确定步长的凸组合算法迭代求解此单层非线性规划,进而得到原双层规划的局部最优解。
6) convex prgramming/DFP method
凸规划/DFP算法
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条