When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 ...

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

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

  6. Bounding volume - Wikipedia

    en.wikipedia.org/wiki/Bounding_volume

    Unfortunately, intersection tests become quickly more expensive as the bounding boxes become more sophisticated. 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 ...

  7. Slab method - Wikipedia

    en.wikipedia.org/wiki/Slab_method

    In computer graphics, the slab method is an algorithm used to solve the ray-box intersection problem in case of an axis-aligned bounding box (AABB), i.e. to determine the intersection points between a ray and the box.

  8. Collision detection - Wikipedia

    en.wikipedia.org/wiki/Collision_detection

    A hitbox is an invisible shape commonly used in video games for real-time collision detection; it is a type of bounding box. It is often a rectangle (in 2D games) or cuboid (in 3D) that is attached to and follows a point on a visible object (such as a model or a sprite).

  9. Axis-aligned object - Wikipedia

    en.wikipedia.org/wiki/Axis-aligned_object

    Minimum bounding boxes are often implicitly assumed to be axis-aligned. A more general case is rectilinear polygons , the ones with all sides parallel to coordinate axes or rectilinear polyhedra. Many problems in computational geometry allow for faster algorithms when restricted to (collections of) axis-oriented objects, such as axis-aligned ...