首页> 外文期刊>Computer-Aided Design >A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path
【24h】

A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path

机译:轮廓平行的刀具路径具有多个岛的鲁棒2D点序列曲线偏移算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

An offset algorithm is important to the contour-parallel tool path generation process. Usually, it is necessary to offset with islands. In this paper a new offset algorithm for a 2D point-sequence curve (PS-curve) with multiple islands is presented. The algorithm consists of three sub-processes, the islands bridging process, the raw offset curve generation and the global invalid loops removal. The input of the algorithm is a set of PS-curves, in which one of them is the outer profile and the others are islands. The bridging process bridges all the islands to the outer profile with the Delaunay triangulation method, forming a single linked PS-curve. With the fact that local problems are caused by intersections of adjacent bisectors, the concept of stuck circle is proposed. Based on stuck circle, local problems are fixed by updating the original profile with the proposed basic rule and append rule, so that a raw offset curve can be generated. The last process first reports all the self-intersections on the raw offset PS-curve, and then a procedure called tree analysis puts all the self-intersections into a tree. All the points between the nodes in even depth and its immediate children are collected using the collecting rule. The collected points form the valid loops, which is the output of the proposed algorithm. Each sub-process can be complete in near linear time, so the whole algorithm has a near linear time complexity. This can be proved by the examples tested in the paper.
机译:偏移算法对于轮廓平行刀具路径生成过程很重要。通常,有必要用孤岛抵消。本文提出了一种具有多个孤岛的二维点序列曲线(PS曲线)的新偏移算法。该算法包括三个子过程:孤岛桥接过程,原始偏移曲线生成和全局无效循环去除。该算法的输入是一组PS曲线,其中一个是外部轮廓,另一个是孤岛。桥接过程使用Delaunay三角剖分方法将所有岛桥接到外部轮廓,从而形成单个链接的PS曲线。鉴于局部问题是由相邻的等分线相交引起的,提出了卡滞圆的概念。基于卡住的圆,通过使用建议的基本规则和附加规则更新原始轮廓来解决局部问题,从而可以生成原始偏移曲线。最后一个过程首先报告原始偏移PS曲线上的所有自交点,然后一个称为树分析的过程将所有自交点放入树中。使用收集规则收集深度相等的节点及其直接子节点之间的所有点。收集到的点形成有效循环,这是所提出算法的输出。每个子过程可以在接近线性的时间内完成,因此整个算法具有接近线性的时间复杂度。这可以通过本文中测试的示例来证明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号