| 相交格子集合边界探寻及其Matlab实现 |
| |
| 引用本文： | 管培祥,张传林,罗小华. 相交格子集合边界探寻及其Matlab实现[J]. 暨南大学学报(自然科学与医学版), 2011, 32(3) |
| |
| 作者姓名： | 管培祥 张传林 罗小华 |
| |
| 作者单位： | 暨南大学信息科学技术学院,广东广州,510632 |
| |
| 基金项目： | 广东省科技计划项目(2009B01080030); 国家自然科学基金天元基金项目(10926141) |
| |
| 摘 要： | 给出一种针对标准正六面体格子集合中探寻两个格子集合公共边界的算法,并利用这种算法在上得到相应边界图示.在两个集合个数分别为和的情况下,算法的时间复杂度以及空间复杂度均为O(mn).
|
| 关 键 词： | 数字空间 正六面体 格子集合 边界 公共边界 |
Common boundary detection between grid sets and its implementation with Matlab |
| |
| GUAN Pei-xiang,ZHANG Chuan-lin,LUO Xiao-hua. Common boundary detection between grid sets and its implementation with Matlab[J]. Journal of Jinan University(Natural Science & Medicine Edition), 2011, 32(3) |
| |
| Authors: | GUAN Pei-xiang ZHANG Chuan-lin LUO Xiao-hua |
| |
| Affiliation: | GUAN Pei-xiang,ZHANG Chuan-lin,LUO Xiao-hua(College of Information Science and Technology,Jinan University,Guangzhou 510632,China) |
| |
| Abstract: | An algorithm to find common boundary between two unit cubic grid subsets and its implementation with Matlab are given.If the sizes of the two subset are m and n,then both time and space complexity of this algorithm are O(mn). |
| |
| Keywords: | digital space cube grid set boundary common boundary |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
