Computing the Center Region and Its Variants

TL;DR

This paper introduces faster algorithms for computing the center region of point sets in 3D and a colored variant in 2D, significantly improving efficiency over previous methods.

Contribution

It presents the first near-quadratic time algorithm for the 3D center region and an efficient algorithm for the colored 2D case, advancing computational geometry techniques.

Findings

3D center region algorithm runs in $O(n^2\log^4 n)$ time

Colored 2D center region computed in $O(n\log^4 n)$ time

Algorithms are nearly optimal given known complexity bounds

Abstract

We present an $O(n^2\log^4 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(n^{2+\epsilon})$ time for any $\epsilon > 0$. It is known that the combinatorial complexity of the center region is $\Omega(n^2)$ in the worst case, thus our algorithm is almost tight. We also consider the problem of computing a colored version of the center region in the two-dimensional Euclidean space and present an $O(n\log^4 n)$-time algorithm.