三维轮廓曲线的快速匹配方法

在许许多多出土文物碎片中借助计算机辅助文物碎片复原，迄今是一个没有被完全解决的问题。笔者给出从提取文物碎片轮廓线出发，解决空间曲线匹配来达到文物碎片复原的方法。同时给出了用于查找三维轮廓线匹配的哈希矢量，以及计算轮廓线子段曲率挠率匹配算法。通过比较两条轮廓线的哈希矢量来分析曲线段的相似度，从理论上给出了判断曲线匹配的性质，如果曲线段之间的距离越小则哈希矢量之间的距离也越小。

A Method for Rapid Matching of 3D Contour Curve

A heretofore unsolved problem of great archaeological importance is the automatic assembly of fragments of cultural relic from the hundreds(or thousands)of sherds found at an excavation sit. This paper presents a novel method for searching for similar fragments of 3D curves. In this method, a Hash vector(a vector of real numbers) is associated with each fixed-length fragments of 3D sherds. Then we can analyze the similarity between fragments by evaluating the difference between Hash vectors. The novel aspect of the method is that the following property is proved theoretically: if the distance between two fragments of curve is small, then the distance between the Hash vectors is small.