Xavier Holt edited CST_Monopolar_Consider_every_point__.md  almost 8 years ago

Commit id: 9c19d99d8f8a9724fa94d7d46ac2189166891f37

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 \( |pi| + |pj| \leq |pj|\) < \(  d \) : * d \(leftarrow |pi| + |pj|\)  * u \(leftarrow p\)  * Return u.