期刊文献+

THE NECESSARY AND SUFFICIENT CONDITION AND THE EFFICIENT ALGORITHMS FOR GRADUALLY VARIED FILL

THE NECESSARY AND SUFFICIENT CONDITION AND THE EFFICIENT ALGORITHMS FOR GRADUALLY VARIED FILL
原文传递
导出
摘要 Filling is an important part in pattern recognition and computer vision. In the discrete plane (grid of plane)∑<sub>2</sub>, fill means 'determination of the region D enclosed by the simple closed curve J which is given beforehand'. In other words, if the valuation of the point on the contour J is 1, we want to do a valuation for ∑<sub>2</sub> to make the valuation of the point p be 1 iff point p belongs to D.
作者 陈溧
出处 《Chinese Science Bulletin》 SCIE EI CAS 1990年第10期870-873,共4页
基金 Project supported by the Science Fund of the Chinese Academy of Sciences for Young Scientists
关键词 gradually varied FILL DIGITAL MANIFOLD algorithm. gradually varied fill,digital manifold,algorithm.
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部