Xavier Holt edited CST_Monopolar_Consider_every_point__.md  almost 8 years ago

Commit id: 6fd5d9fc8d27724b9cb80c1f939dd790a1ddec6c

deletions | additions      

       

Consider every point as a potential pole. For each of these points, find the two points furthest away from   * \(d\leftarrow \infty\) \infty, u\leftarrow\) None  * For all `p` in `P`: O(n)  * Find the two points `i,j` furthest from `p`: \(O(n)\)  * if \(|pi|+|pj| < d\):