Jump to content

Minimum bounding box algorithms

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Altenmann (talk | contribs) at 18:53, 4 July 2007 (←Created page with '{{inprogress}} :''See "Minimum bounding box" for the box specified by minimal and maximal coordinates'' The '''smallest enclosing box''' problem in [[computatio...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

 In progress

See "Minimum bounding box" for the box specified by minimal and maximal coordinates

The smallest enclosing box problem in computational geometry is to find the box (hyperrectangle) of smallest measure (volume, area, perimeter, etc.) for a given object or set of objects.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Minimum_bounding_box_algorithms&oldid=142508874"