首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种快速实现有序搜索图形边界点的新方法
引用本文:张国云,湛腾西.一种快速实现有序搜索图形边界点的新方法[J].湖南理工学院学报,2002,15(3):11-13.
作者姓名:张国云  湛腾西
作者单位:岳阳师范学院物理系 湖南岳阳414006 (张国云),岳阳师范学院物理系 湖南岳阳414006(湛腾西)
摘    要:提出了一种能快速有序搜索边界点的新方法 ,通过比较任一起始边界点S与周边 8个像素点Pfi的值 ,实现按顺时针方向自动识别边界点并记录其坐标。该方法具有编程简单且仅在最小范围局部搜索边界点的特点 ,克服了常规方法采用全局搜索而导致的计算量过大的缺点

关 键 词:快速有序搜索  边界点  像素点  矩阵
文章编号:1008-620X(2002)03-0011-03
修稿时间:2002年6月4日

A New Method Which Can Quickly and Orderly Search the Figure BoundaryY Spots
ZHANG Guo-yun,ZHAN Teng-xi.A New Method Which Can Quickly and Orderly Search the Figure BoundaryY Spots[J].Journal of Hunan Institute of Science and Technology,2002,15(3):11-13.
Authors:ZHANG Guo-yun  ZHAN Teng-xi
Abstract:A new method which can quickly and orderly search the figure boundary spot is proposed. To automatically recognize the boundary spot and to record the coordinate in a clockwise direction are realized through the comparison of the value between the starting randomly boundary spot 'S' and 8 pixels Pfi around 'S'. This method has the character which can program easily and partly search the boundary spot at the minimal range and can overcome the disadvantage of large amount of computation, which the normal method has by overall situation search.
Keywords:quickly and orderly search  boundary spot  pixel  matrix
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号