The discrete 2-center problem

The discrete 2-center problem

0.00 Avg rating0 Votes
Article ID: iaor19991091
Country: United Kingdom
Volume: 20
Issue: 3
Start Page Number: 287
End Page Number: 305
Publication Date: Oct 1998
Journal: Discrete and Computational Geometry
Authors: , ,
Keywords: -centre problem, mathematics
Abstract:

We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; that is, computing two congruent disks of smallest possible radius, centred at two points of P, whose union covers P. Our algorithm runs in time O(n4/3 log5 n).

Reviews

Required fields are marked *. Your email address will not be published.