文件名称：Are Two Curves the Same?
文件大小：780KB
文件格式：PDF
更新时间：2016-07-22 13:25:53
Polynomials curve matching
We present an algorithm for answering the following fundamental question: Given two arbitrary (piecewise) polynomial curves, are they the same? This basic CAGD question is answered by first reducing the two curves into canonical irreducible forms. This is done by reversing the processes of knot refinement, degree raising, and composition. The two curves are then compared in their irreducible forms and their shared domains, if any, are identified. The ability to answer this fundamental identity question will be a boon for numerous applications. In this paper, we demonstrate a few such applications. The algorithm allows one to identify two boundary curves (shared as a common seam) between two different surfaces as an identical curve (or not) even when they are represented differently. Moreover, we show that reparameterization is insecure as a watermarking method, which invalidates the proposal of [8].