An Efficient Algorithm of the Planar 3-Center Problem for a set of the convex position points

摘要：

　　The planar 3-center problem for a set S of points given in the plane asks for three congruent circular disks with the minimum radius,whose union can cover all points of S completely.In this paper,we present an O(n2 log3n)time algorithm for a restricted planar 3-center problem in which the given points are in the convex positions,i.e.The given points are the vertices of a convex polygon exactly.

作者: Donglai Bian Bo Jiang Zhiying Cao

作者单位: School of Information Science and Technology,Dalian Maritime University,Linghai Road 1,Dalian,116026,China

会议类型: 国际会议

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

会议地点: 上海

会议语种:英文

页码: 1-4

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