Find the bounding box containing one or more input boxes; works much like [`hull`](#hull). See also [`aggregateN`](#aggregateN).

Build a bounding box that contains all three of the given bounding boxes. This is equivalent to running `aggregate` with three points but is more efficient.

Construct a bounding box containing all bounding boxes in the given list. If the list is empty, returns `Nothing`. If you know you have at least one bounding box, you can use [`aggregate`](#aggregate) instead.

Like [`aggregate`](#aggregate), but lets you work on any kind of item as long as a bounding box can be extracted from it.

Combination of [`aggregateOf`](#aggregateOf) and [`aggregateN`](#aggregateN).

Get a bounding box that contains the new point. If the box does not contain the new point, the box will grow to fit the new point. If the point is within the box, the same bounding box is returned.

Test to see if the target bounding box is contained withing the bounding box

Returned in clockwise order from top left rotating around clockwise

Get the X and Y dimensions (width and height) of a bounding box.

Creates an infinitely small bounding box. This can be used when growing a bounding box around objects

Expand the given bounding box in all directions by the given offset: Negative offsets will be treated as positive (the absolute value will be used), so the resulting box will always be at least as large as the original. If you need to be able to contract a bounding box, use [`offsetBy`](BoundingBox2d#offsetBy) instead.

Create a bounding box that contains the two points

If the minimum and maximum values are provided in the wrong order (for example if `minX` is greater than `maxX`), then they will be swapped so that the resulting bounding box is valid.

Find the bounding box containing one or more input points. Often ends up being used within a match expression. See also [`hullN`](#hullN).

Build a bounding box that contains all three of the given points. This is equivalent to calling `hull` on three points but is more efficient.

Construct a bounding box containing all _N_ points in the given list. If the list is empty, returns `Nothing`. If you know you have at least one point, you can use [`hull`](#hull) instead.

Like [`hull`](#hull), but lets you work on any kind of item as long as a point can be extracted from it. For example, if you had

Combination of [`hullOf`](#hullOf) and [`hullN`](#hullN).

Attempt to build a bounding box that contains all points common to both given bounding boxes. If the given boxes do not intersect, returns `Nothing`. If two boxes just touch along an edge or at a corner, they are still considered to have an intersection, even though that intersection will have zero area (at least one of its dimensions will be zero).

Test to see if the target bounding box is contained withing the bounding box

Get the four line segments surrounding the bounding box. The lines are created from the top left point, creating line segments around the bounding box clockwise.

Expand or shrink the given bounding box in all the directions by the given distance. A positive offset will cause the bounding box to expand and a negative value will cause it to shrink. Returns `None` if the offset is negative and large enough to cause the bounding box to vanish (that is, if the offset is larger than half the height or half the width of the bounding box, whichever is less). If you only want to expand a bounding box, you can use [`expandBy`](BoundingBox2d#expandBy) instead (which does not return an `Option`).

Check two boxes overlap by at least the given amount. For example, you could implement a tolerant collision check (one that only returns true if the boxes overlap by at least a millimeter, and ignores boxes that just barely touch each other). Overlap is defined as the _minimum_ distance one box would have to move so that it did not touch the other. Boxes that just touch are considered to have an overlap of zero.

Scale a bounding box about a given point by a given scale.

Check if two boxes are separated by at least the given amount. For example, to perform clash detection between some objects, you could use `separatedBy` on those objects' bounding boxes as a quick check to see if the objects had a gap of at least 1 cm between them. Separation is defined as the _minimum_ distance one box would have to move so that it touched the other. (Note that this may be a _diagonal_ distance between corners.) Boxes that just touch are considered to have a separation of zero. will return true even if the two boxes just touch each other.

Translate a bounding box by a given displacement.

Translate a bounding box in a given direction by a given distance.

Create a bounding box that contains both bounding boxes.

Offsets boundingBox irrespective of the resulting bounding box is valid or not.