CAJ | 학술논문

在快速成型和数控领域中对平面轮廓区域的填充是比较繁琐复杂的步骤。为充分扬弃顶点偏置和线段偏置的优缺点，提出了顶点线段混合偏置算法，即在凹点处采用线段偏置，而在凸点处则采用顶点偏置或插入线段方式；为优化起落刀次数，提出用对角曲线连接偏置曲线形成螺旋轨迹的算法，即在归类相同的相邻两条偏置曲线中，以顶点较多的作为主偏置曲线，利用K-D树在相邻多边形查找主偏置曲线每个顶点的最近点，依次求出对角曲线的离散点并且连接获得螺旋轨迹。
재쾌속성형화수공영역중대평면륜곽구역적전충시비교번쇄복잡적보취。위충분양기정점편치화선단편치적우결점，제출료정점선단혼합편치산법，즉재요점처채용선단편치，이재철점처칙채용정점편치혹삽입선단방식；위우화기락도차수，제출용대각곡선련접편치곡선형성라선궤적적산법，즉재귀류상동적상린량조편치곡선중，이정점교다적작위주편치곡선，이용K-D수재상린다변형사조주편치곡선매개정점적최근점，의차구출대각곡선적리산점병차련접획득라선궤적。
It is a complex and cumbersome step to fill the planar contour area in the domain of rapid prototyping and CNC. In order to sublate the characteristic of the vertex offset and segment-offset, an algorithm on hybrid offsetting of vertex and segment is proposed. It is a method of adopting segment-offset at convex point, and uses vertex offset or insert segments at concave point. To reduce the number of interruptions, a spiral path is generated by generating diagonal curve between the similar offset curves. After classifying similar offset curves, the curve with more vertices in every two adjacent offset curves is referred to as the main polygon. By means of the K-D tree created from the vertices in the other curve, the closed vertex is searched for the vertex of the main polygon. Then the points of the diagonal curve are computed by the two closed vertices. The spiral paths are obtained by connecting these points successively.