期刊文献+

覆盖平面点集的最窄圆环

The Smallest Width Annulus Covering a Set of Points
在线阅读 下载PDF
导出
摘要 给出判断一个覆盖平面有限点集的圆环达到最窄的一组充分条件,同时指出,对于一般的平面有限点集而言,其中的一个条件是不可放弃的.这个结果对于解决所谓圆度问题不仅有理论价值,而且有实际意义. Suppose that S is a set of points in E 2, and C∈ker(S ) is the center of an annulus which covers S and has a locally minimal width. We give a sufficient condition for C to be the center of an annulus which covers S and has the globally minimal width.
作者 傅清祥 YapC-K
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2000年第1期57-62,共6页 Journal of Computer-Aided Design & Computer Graphics
基金 国家"九七三"项目!(G1 998030600)
关键词 计算几何 圆度 局部极小值点 最小值点 computational geometry, roundness, local minimum, global minimum
  • 相关文献

参考文献4

  • 1[1]Jesu′s Garci′a-Lo′pez, Pedro A, Ramos, Jack Snoeyink. Fitting a set of points by a circle. In: Proc ACM Conference on Computational Geometry. Los Alamitos:IEEE Computer Society Press, 1997. 129-138
  • 2[2]K Mehlhorn, T C Shermer, C K Yap. A Complete roundness classification procedure. In: 13th ACM Symb on Computational Geometry. Los Alamitos:IEEE Computer Society Press, 1997. 129-139
  • 3[3]C K Yap. Exact computational geometry and tolerancing metrology. Snapshots on Computational Geometry, vol.3,D Avis, P Bose(Eds.),Mc Gill School of Computer Science,Tech Rep No.SOCS-94.50,1994
  • 4[4]Smid Michiel, Janardan Ravi. On the width and roundness of a set of points in the plane. Department of Computer Science, Report TR 94-62, University of Minnesota,1994

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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