We give approximation algorithms for matching two sets of line segments in constant dimension. We consider several versions of the problem: Hausdorff distance, bottleneck distance and largest common subset. We study these similarity measures under several sets of transformations: translations in arbitrary dimension, rotations about a fixed point and rigid motions in two dimensions. As opposed to previous theoretical work on this problem, we match segments individually, in other words we regard our two input sets as sets of segments rather than unions of segments.

中文翻译：

---

匹配线段集

我们给出了近似算法，用于以恒定尺寸匹配两组线段。我们考虑该问题的几种版本：Hausdorff距离，瓶颈距离和最大的公共子集。我们研究了几组变换下的这些相似性度量：任意维度的平移，围绕固定点的旋转以及二维的刚性运动。相对于以往的理论工作，对这个问题，我们分别匹配段，换句话说，我们把我们的两个输入集作为套段，而不是工会段。