{"version":"1.0","type":"link","title":"Smallest-circle problem - Newikis","description":"The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) is a computational geometry problem of computing the smallest circle that contains all of a given set of points in the Euclidean…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/9/9c/Smallest_circle_problem.svg/1280px-Smallest_circle_problem.svg.png","thumbnail_width":1280,"thumbnail_height":1280}