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. Minimum bounding box algorithms - Wikipedia

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

    The minimum bounding box of a regular tetrahedron The minimal enclosing box of the regular tetrahedron is a cube, with side length 1/ √ 2 that of the tetrahedron; for instance, a regular tetrahedron with side length √ 2 fits into a unit cube , with the tetrahedron's vertices lying at the vertices (0,0,0), (0,1,1), (1,0,1) and (1,1,0) of the ...

  5. Computational geometry - Wikipedia

    en.wikipedia.org/wiki/Computational_geometry

    Minimum bounding box algorithms: find the oriented minimum bounding box enclosing a set of points; Nearest neighbor search: find the nearest point or points to a query point; Nesting algorithm: make the most efficient use of material or space; Point in polygon algorithms: tests whether a given point lies within a given polygon

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

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

  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.

  9. List of computer graphics and descriptive geometry topics

    en.wikipedia.org/wiki/List_of_computer_graphics...

    Minimum bounding box; Minimum bounding rectangle; Mipmap; Monte Carlo integration; Morph target animation; Morphing; Morphological antialiasing; Motion blur; Multiple buffering; Multisample anti-aliasing; Multiview orthographic projection; Nearest-neighbor interpolation; Neural radiance field; Non-photorealistic rendering; Non-uniform rational ...