Given a set P of n points on a 2D plane, the 1-corner empty corridor is a region inside the convex hull of P which is bounded by a pair of links; each link is an unbounded trapezium bounded by two parallel half-lines, and it does not contain any point of P. We present an improved algorithm for computing the widest empty 1-corner corridor that runs in O(n~3 (log n)~2) time and O(n~2) space. This improves the time complexity of the best known algorithm for the same problem by a factor of n/log n [4].
展开▼
机译：给定2D平面上的n点的组p，1角空走廊是P的凸壳内的区域，该区域由一对链路界定;每个链接是由两个平行半行有限的无界梯形，并且它不包含任何P.我们介绍了一种改进的算法，用于计算在O（n〜3（log n）中运行的最宽的空1角走廊〜2）时间和O（n〜2）空间。这通过n / log n [4]的因子来提高最着名的算法的时间复杂性。
展开▼
