Minimum bounding box algorithms
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 orientation of the box.
- Comment
- enIn 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 orientation of the box.
- Depiction
- Has abstract
- enIn 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 orientation of the box.
- Is primary topic of
- Minimum bounding box algorithms
- Label
- enMinimum bounding box algorithms
- Link from a Wikipage to another Wikipage
- Area
- Bounding volume
- Category:Geometric algorithms
- Computational geometry
- Convex hull
- Convex polygon
- Coreset
- File:Tetraeder animation with cube.gif
- Godfried Toussaint
- Joseph O'Rourke (professor)
- Linear time
- Minimum bounding box
- Minimum bounding rectangle
- Perimeter
- Regular tetrahedron
- Rotating calipers
- Smallest enclosing ball
- Unit cube
- Volume
- SameAs
- 4sCmj
- m.02vpfxw
- Minimum bounding box algorithms
- Q6865427
- Subject
- Category:Geometric algorithms
- Thumbnail
- WasDerivedFrom
- Minimum bounding box algorithms?oldid=1119537002&ns=0
- WikiPageLength
- 5698
- Wikipage page ID
- 12087943
- Wikipage revision ID
- 1119537002
- WikiPageUsesTemplate
- Template:Radic
