计算折叠多边形之间的Fréchet距离
Computing the Fréchet Distance Between Folded Polygons
摘要:
计算表面的Fréchet距离是一个令人惊讶的困难问题,唯一已知的算法仅限于计算平面之间的距离。我们调整该算法来创建一个用于计算一类非平坦表面(我们称之为折叠多边形)的Fréchet距离的算法。不幸的是,原始算法不能直接扩展。我们提出了三种不同的方法来适应它:第一种是固定参数的易处理算法。第二种是多项式时间的近似算法。最后,我们提出了一个限制类的折叠多边形,我们可以计算的Fréchet距离在多项式时间。
英文摘要:
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known algorithm is limited to computing it between flat surfaces. We adapt this algorithm to create one for computing the Fréchet distance for a class of non-flat surfaces which we call folded polygons. Unfortunately, the original algorithm cannot be extended directly. We present three different methods to adapt it. The first of which is a fixed-parameter tractable algorithm. The second is a polynomial-time approximation algorithm. Finally, we present a restricted class of folded polygons for which we can compute the Fréchet distance in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。