MATEC Web Conf.
Volume 232, 20182018 2nd International Conference on Electronic Information Technology and Computer Engineering (EITCE 2018)
|Number of page(s)||4|
|Section||Algorithm Study and Mathematical Application|
|Published online||19 November 2018|
An Efficient Algorithm of the Planar 3-Center Problem for a set of the convex position points
School of Information Science and Technology, Dalian Maritime University, Linghai Road 1, Dalian, 116026, China
* Corresponding author: aBo Jiang: firstname.lastname@example.org
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.
© The Authors, published by EDP Sciences, 2018
This is an open access article distributed under the terms of the Creative Commons Attribution License 4.0 (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.