Abstract
Given two sets of points A and B in a normed plane, we prove that there are two linearly separable sets A′ and B′ such that diam(A′)≤diam(A), diam(B′)≤diam(B), and A′∪B′=A∪B. As a result, for a given k, some Euclidean k-clustering algorithms are adapted to normed planes, for instance, those that minimize the maximum, the sum, or the sum of squares of the k cluster diameters. The 2-clustering problem is studied when two different bounds are imposed to the diameters. The Hershberger–Suri's data structure for managing ball hulls can be useful in this context.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.