When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Minimum bounding rectangle - Wikipedia

    en.wikipedia.org/wiki/Minimum_bounding_rectangle

    A series of geometric shapes enclosed by its minimum bounding rectangle. In computational geometry, the minimum bounding rectangle (MBR), also known as bounding box (BBOX) or envelope, is an expression of the maximum extents of a two-dimensional object (e.g. point, line, polygon) or set of objects within its x-y coordinate system; in other words min(x), max(x), min(y), max(y).

  3. Minimum bounding box - Wikipedia

    en.wikipedia.org/wiki/Minimum_bounding_box

    A sphere enclosed by its axis-aligned minimum bounding box (in 3 dimensions) In geometry, the minimum bounding box or smallest bounding box (also known as the minimum enclosing box or smallest enclosing box) for a point set S in N dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie.

  4. R-tree - Wikipedia

    en.wikipedia.org/wiki/R-tree

    It also guarantees a minimum fill (except for the root node), however best performance has been experienced with a minimum fill of 30%–40% of the maximum number of entries (B-trees guarantee 50% page fill, and B*-trees even 66%). The reason for this is the more complex balancing required for spatial data as opposed to linear data stored in B ...

  5. List of combinatorial computational geometry topics - Wikipedia

    en.wikipedia.org/wiki/List_of_combinatorial...

    Minimum bounding box (Smallest enclosing box, Smallest bounding box) 2-D case: Smallest bounding rectangle (Smallest enclosing rectangle) There are two common variants of this problem. In many areas of computer graphics, the bounding box (often abbreviated to bbox) is understood to be the smallest box delimited by sides parallel to coordinate ...

  6. Hilbert R-tree - Wikipedia

    en.wikipedia.org/wiki/Hilbert_R-tree

    After a new rectangle is inserted in a leaf node N, AdjustTree is called to fix the MBR and largest Hilbert values in the upper-level nodes. Algorithm Insert(node Root, rect r): /* Inserts a new rectangle r in the Hilbert R-tree. h is the Hilbert value of the rectangle*/ I1. Find the appropriate leaf node:

  7. Minimum bounding box algorithms - Wikipedia

    en.wikipedia.org/wiki/Minimum_bounding_box...

    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 ...

  8. MBR - Wikipedia

    en.wikipedia.org/wiki/MBR

    Cite this page; Get shortened URL; Download QR code; Print/export Download as PDF; Printable version; ... Minimum bounding rectangle; Minimum bit rate; Other fields

  9. Talk:Minimum bounding box algorithms - Wikipedia

    en.wikipedia.org/wiki/Talk:Minimum_bounding_box...

    Download as PDF; Printable version; In other projects ... "A minimum bounding box algorithm and its application to rapid prototyping", C K Chan and S T Tan, The ...