| 一种寻找平面图形中最小封闭线框的方法 |
| |
| 引用本文： | 雷安民.一种寻找平面图形中最小封闭线框的方法[J].科学技术与工程,2010,10(4). |
| |
| 作者姓名： | 雷安民 |
| |
| 作者单位： | 西北工业大学机电学院,西安,710072 |
| |
| 摘 要： | 提出确定平面图形中最小封闭线框的算法。该算法巧妙、简练,时间复杂度是O(n)次乘法。
|
| 关 键 词： | 简单多边形 封闭线框 复杂度 |
| 收稿时间： | 2009/10/21 0:00:00 |
| 修稿时间： | 2009/10/21 0:00:00 |
An algorithm for finding minimal closed frames in plane figures |
| |
| leianmin.An algorithm for finding minimal closed frames in plane figures[J].Science Technology and Engineering,2010,10(4). |
| |
| Authors: | leianmin |
| |
| Institution: | Dept of Electromechanics/a>;Northwestern Polytechnical University/a>;Xi' an 710072/a>;P.R.China |
| |
| Abstract: | 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 0(n). |
| |
| Keywords: | simple polygon closed frame complexity |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《科学技术与工程》浏览原始摘要信息 |
| 点击此处可从《科学技术与工程》下载免费的PDF全文 |
