Before revision:   The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either p'- p \leq \varepsilon R, R= \max \{ p -v : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S). By the Spherical}-CHM we mean a CHM, where p=0 , v =1, \forall v \in S . First, we prove the equivalence of exact and approximate versions of CHM and Spherical-CHM.
After revision:  The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either p'- p \leq \varepsilon R, R= \max \{ p -v : v\in S\ {\it witness  Spherical}-CHM we mean a CHM, where p=0 , v =1, \forall v \in S . First, we prove the equivalence of exact and approximate versions of CHM and Spherical-CHM.