| 三维空间中面对象相邻关系的判断算法 |
| |
| 引用本文： | 孙晓明,吉根林. 三维空间中面对象相邻关系的判断算法[J]. 南京师范大学学报, 2011, 0(2) |
| |
| 作者姓名： | 孙晓明 吉根林 |
| |
| 作者单位： | 南京师范大学计算机科学与技术学院;江苏省信息安全保密技术工程研究中心; |
| |
| 基金项目： | 国家自然科学基金(40871176) |
| |
| 摘 要： | 提出了三维空间中面对象相邻关系的判断算法CRAR与算法CRAR-DF.计算空间面对象与其他空间对象之间的距离,如果该距离小于给定的阈值,则认为面对象与该对象相邻.算法CRAR-DF在算法CRAR的基础上利用距离函数进行相邻关系的快速判断.实验结果表明,算法CRAR和算法CRAR-DF能够准确地判断面对象的相邻关系,且CRAR-DF具有较高的效率.
|
| 关 键 词： | 三维拓扑分析 相邻关系 面对象 |
Algorithms for Computing Region Adjacent Relations in 3D Space |
| |
| Sun Xiaoming,Ji Genlin. Algorithms for Computing Region Adjacent Relations in 3D Space[J]. Journal of Nanjing Nor Univ: Eng and Technol, 2011, 0(2) |
| |
| Authors: | Sun Xiaoming Ji Genlin |
| |
| Affiliation: | Sun Xiaoming,Ji Genlin(1.School of Computer Science and Technology,Nanjing Normal University,Nanjing 210097,China,2.Jiangsu Research Center of Information Security and Privacy Technology,China) |
| |
| Abstract: | Algorithms CRAR and CRAR-DF are proposed for computing region adjacent relations in 3D space in this paper.Region objects and other spatial objects are adjacent if their distance is less than threshold value.Based on CRAR,CRAR-DF judges adjacent relations rapidly according to distance function.The experimental results show that algorithms CRAR and CRAR-DF are effective and CRAR-DF is more efficient. |
| |
| Keywords: | 3D topological analysis adjacent relation region |
| 本文献已被 CNKI 等数据库收录！ |
|
