论文标题
改进的算法用于计算最大体积的双重分离框
Improved Algorithm for Computing the Maximum-volume Bichromatic Separating Box
论文作者
论文摘要
我们考虑了计算一组$ N $红点和三个维度的$ M $ blue点之间计算最大面积的双重分离框的问题。目前，解决此问题的最著名算法需要$ O（m^2（m + n））$时间和$ o（m + n）$ space。在本文中，我们提出了一个改进的问题算法，该算法需要$ O（m^2 + n）$时间。
We consider the problem of computing the largest-area bichromatic separating box among a set of $n$ red points and a set of $m$ blue points in three dimensions. Currently, the best-known algorithm to solve this problem takes $O(m^2 (m + n))$ time and $O(m + n)$ space. In this paper, we come up with an improved algorithm for the problem, which takes $O(m^2 + n)$ time.
