Minimum bounding box algorithms
id:
minimum-bounding-box-algorithms-287-13537639
title:
Minimum bounding box algorithms
text:
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. It is sufficient to find the smallest enclosing box for the convex hull of the objects in question. It is straightforward to find the smallest enclosing box that has sides parallel to the coordinate axes; the difficult part of the problem is to determine the
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Minimum_bounding_box_algorithms
date created:
date modified:
2023-08-13T04:39:10Z
main entity:
{"identifier":"Q6865427","url":"https://www.wikidata.org/entity/Q6865427"}
image:
fields total:
13
integrity:
13