Space-efficient algorithm for computing a centerpoint of a set of points in R2
Article Type
Research Article
Publication Title
Theoretical Computer Science
Abstract
We study a space-efficient algorithm for computing a centerpoint for a set P of n points in R2, 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(n2)log3 n) time using O(S(n2)) 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 R2.
First Page
61
Last Page
70
DOI
10.1016/j.tcs.2015.11.048
Publication Date
2-15-2016
Recommended Citation
Bhattacharya, Binay K.; Nandy, Subhas C.; and Roy, Sasanka, "Space-efficient algorithm for computing a centerpoint of a set of points in R2" (2016). Journal Articles. 4454.
https://digitalcommons.isical.ac.in/journal-articles/4454
