节点文献

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

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 陈溧

【Author】 CHEN LI(Department of Computer Science, Wuhan University, Wuhan 430072, PRC)

【机构】 Department of Computer ScienceWuhan UniversityWuhan 430072PRC

【摘要】 <正> Filling is an important part in pattern recognition and computer vision. In the discrete plane (grid of plane)∑2, 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 ∑2 to make the valuation of the point p be 1 iff point p belongs to D.

【基金】 Project supported by the Science Fund of the Chinese Academy of Sciences for Young Scientists
  • 【文献出处】 Chinese Science Bulletin ,科学通报(英文版) , 编辑部邮箱 ,1990年10期
  • 【下载频次】10
节点文献中: 

本文链接的文献网络图示:

本文的引文网络