{"version":"1.0","type":"link","title":"Minimum bounding box algorithms - Newikis","description":"In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. \"Smallest\" may refer to volume, area, perimeter, etc. of the box.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}