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. R-tree - Wikipedia

    en.wikipedia.org/wiki/R-tree

    The key idea of the data structure is to group nearby objects and represent them with their minimum bounding rectangle in the next higher level of the tree; the "R" in R-tree is for rectangle. Since all objects lie within this bounding rectangle, a query that does not intersect the bounding rectangle also cannot intersect any of the contained ...

  4. Minimum bounding box algorithms - Wikipedia

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

    Then, this initial bounding box is partitioned into a grid of smaller cubes, and grid points near the boundary of the convex hull of the input are used as a coreset, a small set of points whose optimum bounding box approximates the optimum bounding box of the original input. Finally, O'Rourke's algorithm is applied to find the exact optimum ...

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

  6. List of combinatorial computational geometry topics - Wikipedia

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

    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 axes which encloses the objects in question.

  7. Shapefile - Wikipedia

    en.wikipedia.org/wiki/Shapefile

    Minimum bounding rectangle (MBR) of all shapes contained within the dataset; four doubles in the following order: min X, min Y, max X, max Y 68–83: double: little: Range of Z; two doubles in the following order: min Z, max Z 84–99: double: little: Range of M; two doubles in the following order: min M, max M

  8. Bounding volume - Wikipedia

    en.wikipedia.org/wiki/Bounding_volume

    A bounding box or minimum bounding box (MBB) is a cuboid, or in 2-D a rectangle, containing the object. In dynamical simulation, bounding boxes are preferred to other shapes of bounding volume such as bounding spheres or cylinders for objects that are roughly cuboid in shape when the intersection test needs to be fairly accurate. The benefit is ...

  9. Spatial database - Wikipedia

    en.wikipedia.org/wiki/Spatial_database

    However, in MySQL version 5.5 and earlier, functions that test spatial relationships are limited to working with minimum bounding rectangles rather than the actual geometries. MySQL versions earlier than 5.0.16 only supported spatial data in MyISAM tables. As of MySQL 5.0.16, InnoDB, NDB, BDB, and ARCHIVE also support spatial features.