首页> 外文期刊>IEEE Transactions on Pattern Analysis and Machine Intelligence >An efficiently computable metric for comparing polygonal shapes
【24h】

An efficiently computable metric for comparing polygonal shapes

机译:用于比较多边形形状的有效可计算指标

获取原文
获取原文并翻译 | 示例

摘要

A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented. The method is based on the L/sub 2/ distance between the turning functions of the two polygons. It works for both convex and nonconvex polygons and runs in time O(mn log mn), where m is the number of vertices in one polygon and n is the number of vertices in the other. Some examples showing that the method produces answers that are intuitively reasonable are presented.
机译:提出了一种比较多边形的方法,该方法是公制的,在平移,旋转和缩放比例不变的情况下保持不变,合理地易于计算并且直观。该方法基于两个多边形的车削函数之间的L / sub 2 /距离。它适用于凸多边形和非凸多边形,并且在时间O(mn log mn)内运行,其中m是一个多边形中的顶点数,n是另一个多边形中的顶点数。给出了一些示例,表明该方法产生的直观答案是合理的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号