This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We provide a complete answer to the problem which consists in finding an unpointed convex cone lying at minimal bounded Pompeiu-Hausdorff distance from a pointed one. We give also...
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...