1) minimum enclosing ball
最小包围球
1.
This paper analyses support vector domain description algorithm aiming at one-class problem,then gives a simplified algorithm,which construct a separate minimum enclosing ball for each type of samples,not only re-duces the quadratic programming problem of complexity,and easy expansion.
文章通过对一类问题最小包围球研究分析的基础上提出了一种简化算法,该算法对每一类别样本单独构造一个近似最小超球,不仅降低了二次规划问题的复杂度,而且易于扩充。
2) encasing box
最小包围盒
3) minimum envelope circle
最小包围圆
1.
By use of the method of minimum envelope circle of two-dimensional points collection,the inverse plumb hole s valid diameter and center point can be calculated rapidly and exactly.
对于给定的平面点集S,可以通过相应的算法找到包含点集S中所有点的半径最小的圆,这就是最小包围圆的思想。
4) minimum contain cphere
最小包容球
6) minimal boundary rectangle
最小包围矩形
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条