• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国政府科技报告 >Finding a Minimum Covering Circle Based on Infinity Norms; Final rept. Oct 2007-Feb 2008
【24h】

Finding a Minimum Covering Circle Based on Infinity Norms; Final rept. Oct 2007-Feb 2008

机译：根据无穷规范寻找最小覆盖圆;最终的评论。 2007年10月至2008年2月

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This report discusses the use of infinity norms to solve the problem of finding the minimum covering radius for a set of points. The minimum covering radius can be used as a measure of the accuracy of a collection of shots or a description of spall fragments. The algorithm worked well for the data sets investigated, sometimes converging in three iterations; however, in some cases, there were hundreds of iterations. For specific metrics, it would be possible to use directional derivatives to improve the convergence of the process. The overall design is based on defining an improvement step to be repeated until the state of the process fulfills a specific criterion. Infinity norms offer a theoretic framework for algorithm development.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号