VRageMath.BoundingBoxI

← Index

BoundingBoxI Struct

public struct BoundingBoxI: ValueType, IEquatable<T>

Namespace: VRageMath
Assembly: VRage.Math.dll

Inheritance: ValueType

Implements:

• IEquatable

Example

Remarks

Fields

Member	Description
Min	The minimum point the BoundingBoxI contains.
Max	The maximum point the BoundingBoxI contains.
CornerCount	Specifies the total number of corners (8) in the BoundingBoxI.

Properties

Member	Description
Center	Calculates center
HalfExtents
Size	Size
Perimeter	return perimeter of edges
IsValid

Methods

Member	Description
GetCorners()	Gets an array of points that make up the corners of the BoundingBoxI.
GetCorners(Vector3I[])	Gets the array of points that make up the corners of the BoundingBoxI.
GetCornersUnsafe(*Vector3I)
Equals(BoundingBoxI)	Determines whether two instances of BoundingBoxI are equal.
Equals(object)	Determines whether two instances of BoundingBoxI are equal.
GetHashCode()	Gets the hash code for this instance.
ToString()	Returns a String that represents the current BoundingBoxI.
CreateMerged(BoundingBoxI, BoundingBoxI)	Creates the smallest BoundingBoxI that contains the two specified BoundingBoxI instances.
CreateMerged(ref BoundingBoxI, ref BoundingBoxI, ref BoundingBoxI)	Creates the smallest BoundingBoxI that contains the two specified BoundingBoxI instances.
CreateFromSphere(BoundingSphere)	Creates the smallest BoundingBoxI that will contain the specified BoundingSphere.
CreateFromSphere(ref BoundingSphere, ref BoundingBoxI)	Creates the smallest BoundingBoxI that will contain the specified BoundingSphere.
CreateFromPoints(IEnumerable)
IntersectWith(ref BoundingBoxI)	Returns bounding box which is intersection of this and box It's called 'Prunik' Result is invalid box when there's no intersection (Min > Max)
Intersect(BoundingBoxI)	Returns bounding box which is intersection of this and box It's called 'Prunik' Result is invalid box when there's no intersection (Min > Max)
Intersects(BoundingBoxI)	Checks whether the current BoundingBoxI intersects another BoundingBoxI.
Intersects(ref BoundingBoxI)
Intersects(ref BoundingBoxI, ref bool)	Checks whether the current BoundingBoxI intersects another BoundingBoxI.
IntersectsTriangle(Vector3I, Vector3I, Vector3I)
IntersectsTriangle(ref Vector3I, ref Vector3I, ref Vector3I)
Intersects(Plane)	Checks whether the current BoundingBoxI intersects a Plane.
Intersects(ref Plane, ref PlaneIntersectionType)	Checks whether the current BoundingBoxI intersects a Plane.
Intersects(Line, ref float)
Intersects(Ray)	Checks whether the current BoundingBoxI intersects a Ray.
Intersects(ref Ray, ref Nullable)
Distance(Vector3I)	Checks whether the current BoundingBoxI intersects a BoundingSphere.
Contains(BoundingBoxI)	Tests whether the BoundingBoxI contains another BoundingBoxI.
Contains(ref BoundingBoxI, ref ContainmentType)	Tests whether the BoundingBoxI contains a BoundingBoxI.
Contains(Vector3I)	Tests whether the BoundingBoxI contains a point.
Contains(Vector3)
Contains(ref Vector3I, ref ContainmentType)	Tests whether the BoundingBoxI contains a point.
Translate(Vector3I)	Translate
Include(ref Vector3I)	return expanded aabb (abb include point)
GetIncluded(Vector3I)
Include(Vector3I)
Include(Vector3I, Vector3I, Vector3I)
Include(ref Vector3I, ref Vector3I, ref Vector3I)
Include(ref BoundingBoxI)	return expanded aabb (abb include point)
Include(BoundingBoxI)
CreateInvalid()
SurfaceArea()
Volume()
Inflate(int)
InflateToMinimum(Vector3I)
IterateDifference(BoundingBoxI, BoundingBoxI)	Iterate every cell contained in {left} - {right}, where we interpret {box} as the set of all distinct Vector3I points inside a 'box'. Containment is taken in a typical inclusive start, exclusive end fashion.
EnumeratePoints(BoundingBoxI)	Enumerate all values in a integer interval (a cuboid). This method is an allocating version of the Vector3I_RangeIterator. This once can be used in the foreach syntax though so it's more convenient for debug routines.