1) the least angle and the largest side
最小角最长边
1.
This paper presents the principle of the least angle and the largest side by using the method of advancing front to generate the triangular element for planar domain.
利用前沿生成法生成平面计算区域的三角形单元 ,提出了最小角最长边原则 ,并用该方法生成的三角形单元网格运用到思贤水流数学模型计算中 ,取得良好的效
2) minimum length increase principle
边长差最小原则
1.
A sorting algorithm for section data point is proposed,first the minimum enclosed polygon is built,then the data points is inserted into the polygon according to minimum length increase principle,a new polygon containing all data points is formed.
提出一种截面线数据点排序算法,该算法计算截面线数据点的最小包围多边形,将截面线数据点依据边长差最小原则插入到最小包围多边形中,形成包含所有数据点的多边形,顺序连接该多边形各顶点,实现对截面线数据点的排序。
3) maximal side
最大边长
4) Least Chimb
最小凸边
5) Minimum Edge-degree
最小边度
6) the smallest line approach
最小边法
1.
But these two approaches all have the obvious flaw in the actual operation process, this paper proposes the smallest line approach of one new optimizing network route, this approach has overcome insufficiency of these two approaches in the certain degree.
但这两种方法在实际操作过程中都存在明显的缺陷,文章提出了一种全新的优化网络路线的方法——最小边法,该方法在一定程度上克服了这两种方法的不足。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条