Abstract
We present an O(n2 log4 n)-time algorithm for computing the center region of a set of n points in the three-dimensional Euclidean space. This improves the previously best known algorithm by Agarwal, Sharir and Welzl, which takes O(n2+ε) time for any ε > 0. It is known that the complexity of the center region is Ω(n2), thus our algorithm is almost tight. The second problem we consider is computing a colored version of the center region in the two-dimensional Euclidean space. We present an O(n log4 n)-time algorithm for this problem.
Cite
CITATION STYLE
Oh, E., & Ahn, H. K. (2017). Computing the center region and its variants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10167 LNCS, pp. 254–265). Springer Verlag. https://doi.org/10.1007/978-3-319-53925-6_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
