Xavier Holt edited CST_Monopolar_Consider_every_point__.md  almost 8 years ago

Commit id: e65c8412a3410dfa45fed483e2b9e55b47e7f81b

deletions | additions      

       

* \(d\leftarrow \infty; u\leftarrow\) None  * For all `p` in `P`: O(n)  * Find the two points `i,j` furthest from `p`: \(O(n)\)  * if If  \(|pi|+|pj| < d\): * d \(leftarrow |pi| + |pj|\)  * u \(leftarrow p\)  * Return u.