摘要
提出确定平面图形中最小封闭线框的算法。该算法巧妙、简练,时间复杂度是O(n)次乘法。
A new algorithm for detecting the minimum closed frame in 2D figures is presented. The experimental results show that the method we proposed is ingenious and simple,time complexity of the algorithm is O（n）.
出处
《科学技术与工程》
2010年第4期1021-1023,共3页
Science Technology and Engineering
