基于回溯的参考点边界搜索算法

AN ALGORITHM FOR ROTATING POLYGONS CONTACTION

边界搜索算法是计算机图形学、几何造型中的一个重要问题．文中通过分析边界搜索的路径跟踪规律，给出了跟踪中各几何条件的数学形式，利用微分几何的有关理论导出了它们的变化规律，在此基础上得到了比较交点弧长、相对切矢角和规一曲率三个代数量的路径搜索算法，较完整地解决了边界搜索问题．

An algorithm for contaction of rotating polygons is presented. By abstracting monotone segments of polygon related to the point, the algorithm converts the problem of rotating polygon contaction to the problem of contaction among rotating part polygon's lines. As a result, the algorithm decreases the work of computing and has a high speed.