Temel Kavramlar
凸多角形の包含問題における新しいアルゴリズムによる高速化と、一般的なkに対する実行時間の改善。
İstatistikler
O(n polylog n)-time algorithm for k = 3.
O(kO(1/ε)n1+ε)-time algorithm for any ε > 0.
Alıntılar
"Previous algorithms by Chazelle (1983), Sharir and Toledo (1994), and Agarwal, Amenta, and Sharir (1998) all required Ω(n^2) time."
"We present a significantly faster new algorithm for k = 3 achieving O(n polylog n) running time."