| 判别简单多边形的核为空的快速算法 |
| |
| 引用本文： | 于存光. 判别简单多边形的核为空的快速算法[J]. 价值工程, 2014, 0(5): 191-192 |
| |
| 作者姓名： | 于存光 |
| |
| 作者单位： | 黑龙江科技大学,哈尔滨150022 |
| |
| 基金项目： | 国家自然基金资助项目,项目号：51105135;黑龙江省教育厅科学技术研究项目,项目号：12521471. |
| |
| 摘 要： | 简单多边形的核是位于多边形内部的一个点集,从其中任意一点可见多边形的全部边界。根据多边形的核只与多边形凹点有关,只对多边形的凹顶点进行处理。当多边形有连续凹点时,利用平行射线法和线性求交法迅速判断多边形是否有核,在多边形有核时可以求多边形核的一个交点的时间复杂度。
|
| 关 键 词： | 计算几何 简单多边形 多边形核 多边形无核 |
Fast Algorithm for Discrimination of Simple Polygon Seedless |
| |
| YU Cun-guang. Fast Algorithm for Discrimination of Simple Polygon Seedless[J]. Value Engineering, 2014, 0(5): 191-192 |
| |
| Authors: | YU Cun-guang |
| |
| Affiliation: | YU Cun-guang ( Heilongjiang University of Science and Technology, Harbin 150022, China ) |
| |
| Abstract: | Nuclear of simple polygon is a set of points inside the polygon, any one of which can be seen from all the boundaries of the polygon. According to the fact that the nuclear of polygon only relates to the polygon pits, it only needs to deal with the pitsof the polygon. When there are continuous pits in one polygon, using the parallel ray method and linear intersection method can quickly determine whether the polygon has nuclear. When the polygon has nuclear, the time complexity of the node of polygon nuclear can be calculated. |
| |
| Keywords: | computational geometry simple polygon polygon nuclear polygon seedless |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
