Space-efficient algorithm for computing a centerpoint of a set of points in R-2

作者：Bhattacharya Binay K; Nandy Subhas C^*; Roy Sasanka

来源：Theoretical Computer Science, 2016, 615: 61-70.

DOI：10.1016/j.tcs.2015.11.048

• Centerpoint
• Space-efficient algorithm
• Prune-and-search
• Duality
• Arrangement

We study a space-efficient algorithm for computing a centerpoint for a set P of n points in R-2, where the points in P are given in a read-only array. We propose an algorithm that finds a centerpoint of P in O (T (n(2)) log(3) n) time using O (S(n(2))) extra space, where T(n) and S(n) are the time and extra space complexities of computing the median among a set of n elements stored in a read-only array. We also present the applications of this algorithm for computing the Tukey depth and k-hull of a point set in R-2.

• 出版日期2016-2-15