文章基本信息

标题：An Efficient Algorithm of the Planar 3-Center Problem for a set of the convex position points
本地全文：下载
作者：Donglai Bian ; Bo Jiang ; Zhiying Cao 等
期刊名称：MATEC Web of Conferences
电子版ISSN：2261-236X
出版年度：2018
卷号：232
DOI：10.1051/matecconf/201823203022
语种：English
出版社：EDP Sciences
摘要：The planar 3-center problem for a setSof points given in the plane asks for three congruent circular disks with the minimum radius, whose union can cover all points ofScompletely. In this paper, we present anO(n2log3n) 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.