An Efficient Algorithm for Touring n Circles

摘要：

　　This paper proposed an intelligent algorithm,which can build the shortest path of the intersecting circle sequences in the plane.The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.And it is also an in-depth study of the traversal problem for the disjoint circle sequences.On the basis of the previous work,the algorithms are developed to construct such shortest path in polynomial time of O(kn)where 1 ≤ k ≤ n under a given computational threshold.Since the algorithm is fully polynomial time consuming,this work can be conducted in layered manufacturing of rapid prototyping,displacement of wireless sensor networks,or other related computer-aided design and manufacturing applications.

作者: Yuepeng Ding Xiong Xie Bo Jiang

作者单位: Dalian Maritime University,Linghai Road 1,Dalian,China

会议类型: 国际会议

会议名称: 2018 2nd International Conference on Electronic Information Technology and Computer Engineering (EITCE 2018)(2018第二届电子信息技术与计算机工程国际会议)(EITCE2018)

会议地点: 上海

会议语种:英文

页码: 1-6

在线出版日期: 2018-10-12（万方平台首次上网日期，不代表论文的发表时间）