线段集的模式匹配
Pattern Matching for sets of segments
摘要:
在本文中,我们提出了一些问题的几何模式匹配的输入部分在平面上的集合。我们的工作包括两个主要部分。在第一,我们解决的问题和措施,涉及到在平面上的正交线段的集合。此类集合自然源于建筑物测绘和机器人探索中的问题。我们提出了一个新的措施段相似性称为\emph{coverage measure},并提出了有效的算法,最大限度地提高这一措施之间的轴平行段下的翻译。我们的算法在一般情况下运行在时间$O(n^3\polylog n)$,并运行在时间$O(n^2\polylog n)$的情况下,当所有的段是水平的。此外,我们表明,当仅限于垂直的翻译,两组水平段之间的Hausdorff距离可以计算时间大致$O(n^{3/2}{\sl polylog}n)$。这些算法形成了对Chew等人的耗时的一般算法$O(n^4 \log^2 n)$的显著改进。在本文的第二部分中,我们解决的问题,匹配多边形链。我们研究了著名的\Frd,并提出了第一个算法计算下的一般翻译的\Frd。我们的方法也产生算法计算的\Fr距离的泛化,我们还提出了一个简单的近似算法的\Frd运行时间$O(n^2\polylog n)$。
英文摘要:
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and measures that relate to collections of orthogonal line segments in the plane. Such collections arise naturally from problems in mapping buildings and robot exploration. We propose a new measure of segment similarity called a \emph{coverage measure}, and present efficient algorithms for maximising this measure between sets of axis-parallel segments under translations. Our algorithms run in time $O(n^3\polylog n)$ in the general case, and run in time $O(n^2\polylog n)$ for the case when all segments are horizontal. In addition, we show that when restricted to translations that are only vertical, the Hausdorff distance between two sets of horizontal segments can be computed in time roughly $O(n^{3/2}{\sl polylog}n)$. These algorithms form significant improvements over the general algorithm of Chew et al. that takes time $O(n^4 \log^2 n)$. In the second part of this paper we address the problem of matching polygonal chains. We study the well known \Frd, and present the first algorithm for computing the \Frd under general translations. Our methods also yield algorithms for computing a generalization of the \Fr distance, and we also present a simple approximation algorithm for the \Frd that runs in time $O(n^2\polylog n)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。