// Copyright (c) 2012-2021 Wojciech Figat. All rights reserved. // ----------------------------------------------------------------------------- // Original code from SharpDX project. https://github.com/sharpdx/SharpDX/ // Greetings to Alexandre Mutel. Original code published with the following license: // ----------------------------------------------------------------------------- // Copyright (c) 2010-2014 SharpDX - Alexandre Mutel // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. // ----------------------------------------------------------------------------- // Original code from SlimMath project. http://code.google.com/p/slimmath/ // Greetings to SlimDX Group. Original code published with the following license: // ----------------------------------------------------------------------------- /* * Copyright (c) 2007-2011 SlimDX Group * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ using System; using System.Globalization; using System.Runtime.CompilerServices; namespace FlaxEngine { [Serializable] partial struct BoundingSphere : IEquatable, IFormattable { /// /// A which represents an empty space. /// public static readonly BoundingSphere Empty = new BoundingSphere(Vector3.Zero, 0.0f); /// /// Initializes a new instance of the struct. /// /// The center of the sphere in three dimensional space. /// The radius of the sphere. public BoundingSphere(Vector3 center, float radius) { Center = center; Radius = radius; } /// /// Determines if there is an intersection between the current object and a . /// /// The ray to test. /// Whether the two objects intersected. public bool Intersects(ref Ray ray) { float distance; return CollisionsHelper.RayIntersectsSphere(ref ray, ref this, out distance); } /// /// Determines if there is an intersection between the current object and a . /// /// The ray to test. /// /// When the method completes, contains the distance of the intersection, /// or 0 if there was no intersection. /// /// Whether the two objects intersected. public bool Intersects(ref Ray ray, out float distance) { return CollisionsHelper.RayIntersectsSphere(ref ray, ref this, out distance); } /// /// Determines if there is an intersection between the current object and a . /// /// The ray to test. /// /// When the method completes, contains the point of intersection, /// or if there was no intersection. /// /// Whether the two objects intersected. public bool Intersects(ref Ray ray, out Vector3 point) { return CollisionsHelper.RayIntersectsSphere(ref ray, ref this, out point); } /// /// Determines if there is an intersection between the current object and a . /// /// The plane to test. /// Whether the two objects intersected. public PlaneIntersectionType Intersects(ref Plane plane) { return CollisionsHelper.PlaneIntersectsSphere(ref plane, ref this); } /// /// Determines if there is an intersection between the current object and a triangle. /// /// The first vertex of the triangle to test. /// The second vertex of the triangle to test. /// The third vertex of the triangle to test. /// Whether the two objects intersected. public bool Intersects(ref Vector3 vertex1, ref Vector3 vertex2, ref Vector3 vertex3) { return CollisionsHelper.SphereIntersectsTriangle(ref this, ref vertex1, ref vertex2, ref vertex3); } /// /// Determines if there is an intersection between the current object and a . /// /// The box to test. /// Whether the two objects intersected. public bool Intersects(ref BoundingBox box) { return CollisionsHelper.BoxIntersectsSphere(ref box, ref this); } /// /// Determines if there is an intersection between the current object and a . /// /// The box to test. /// Whether the two objects intersected. public bool Intersects(BoundingBox box) { return Intersects(ref box); } /// /// Determines if there is an intersection between the current object and a . /// /// The sphere to test. /// Whether the two objects intersected. public bool Intersects(ref BoundingSphere sphere) { return CollisionsHelper.SphereIntersectsSphere(ref this, ref sphere); } /// /// Determines if there is an intersection between the current object and a . /// /// The sphere to test. /// Whether the two objects intersected. public bool Intersects(BoundingSphere sphere) { return Intersects(ref sphere); } /// /// Determines whether the current objects contains a point. /// /// The point to test. /// The type of containment the two objects have. public ContainmentType Contains(ref Vector3 point) { return CollisionsHelper.SphereContainsPoint(ref this, ref point); } /// /// Determines whether the current objects contains a triangle. /// /// The first vertex of the triangle to test. /// The second vertex of the triangle to test. /// The third vertex of the triangle to test. /// The type of containment the two objects have. public ContainmentType Contains(ref Vector3 vertex1, ref Vector3 vertex2, ref Vector3 vertex3) { return CollisionsHelper.SphereContainsTriangle(ref this, ref vertex1, ref vertex2, ref vertex3); } /// /// Determines whether the current objects contains a . /// /// The box to test. /// The type of containment the two objects have. public ContainmentType Contains(ref BoundingBox box) { return CollisionsHelper.SphereContainsBox(ref this, ref box); } /// /// Determines whether the current objects contains a . /// /// The sphere to test. /// The type of containment the two objects have. public ContainmentType Contains(ref BoundingSphere sphere) { return CollisionsHelper.SphereContainsSphere(ref this, ref sphere); } /// /// Constructs a that fully contains the given points. /// /// The points that will be contained by the sphere. /// The start index from points array to start compute the bounding sphere. /// The count of points to process to compute the bounding sphere. /// When the method completes, contains the newly constructed bounding sphere. /// points /// /// start /// or /// count /// public static void FromPoints(Vector3[] points, int start, int count, out BoundingSphere result) { if (points == null) throw new ArgumentNullException(nameof(points)); // Check that start is in the correct range if ((start < 0) || (start >= points.Length)) throw new ArgumentOutOfRangeException(nameof(start), start, string.Format("Must be in the range [0, {0}]", points.Length - 1)); // Check that count is in the correct range if ((count <= 0) || (start + count > points.Length)) throw new ArgumentOutOfRangeException(nameof(count), count, string.Format("Must be in the range <= {0}", points.Length)); int upperEnd = start + count; //Find the center of all points. Vector3 center = Vector3.Zero; for (int i = start; i < upperEnd; ++i) Vector3.Add(ref points[i], ref center, out center); //This is the center of our sphere. center /= (float)count; //Find the radius of the sphere var radius = 0f; for (int i = start; i < upperEnd; ++i) { //We are doing a relative distance comparison to find the maximum distance //from the center of our sphere. float distance; Vector3.DistanceSquared(ref center, ref points[i], out distance); if (distance > radius) radius = distance; } //Find the real distance from the DistanceSquared. radius = (float)Math.Sqrt(radius); //Construct the sphere. result.Center = center; result.Radius = radius; } /// /// Constructs a that fully contains the given points. /// /// The points that will be contained by the sphere. /// When the method completes, contains the newly constructed bounding sphere. public static void FromPoints(Vector3[] points, out BoundingSphere result) { if (points == null) throw new ArgumentNullException(nameof(points)); FromPoints(points, 0, points.Length, out result); } /// /// Constructs a that fully contains the given points. /// /// The points that will be contained by the sphere. /// The newly constructed bounding sphere. public static BoundingSphere FromPoints(Vector3[] points) { BoundingSphere result; FromPoints(points, out result); return result; } /// /// Constructs a from a given box. /// /// The box that will designate the extents of the sphere. /// When the method completes, the newly constructed bounding sphere. public static void FromBox(ref BoundingBox box, out BoundingSphere result) { Vector3.Lerp(ref box.Minimum, ref box.Maximum, 0.5f, out result.Center); float x = box.Minimum.X - box.Maximum.X; float y = box.Minimum.Y - box.Maximum.Y; float z = box.Minimum.Z - box.Maximum.Z; var distance = (float)Math.Sqrt(x * x + y * y + z * z); result.Radius = distance * 0.5f; } /// /// Constructs a from a given box. /// /// The box that will designate the extents of the sphere. /// The newly constructed bounding sphere. public static BoundingSphere FromBox(BoundingBox box) { BoundingSphere result; FromBox(ref box, out result); return result; } /// /// Constructs a that is the as large as the total combined area of the two specified /// spheres. /// /// The first sphere to merge. /// The second sphere to merge. /// When the method completes, contains the newly constructed bounding sphere. public static void Merge(ref BoundingSphere value1, ref BoundingSphere value2, out BoundingSphere result) { // Pre-exit if one of the bounding sphere by assuming that a merge with an empty sphere is equivalent at taking the non-empty sphere if (value1 == Empty) { result = value2; return; } if (value2 == Empty) { result = value1; return; } Vector3 difference = value2.Center - value1.Center; float length = difference.Length; float radius = value1.Radius; float radius2 = value2.Radius; if (radius + radius2 >= length) { if (radius - radius2 >= length) { result = value1; return; } if (radius2 - radius >= length) { result = value2; return; } } Vector3 vector = difference * (1.0f / length); float min = Math.Min(-radius, length - radius2); float max = (Math.Max(radius, length + radius2) - min) * 0.5f; result.Center = value1.Center + vector * (max + min); result.Radius = max; } /// /// Constructs a that is the as large as the total combined area of the two specified /// spheres. /// /// The first sphere to merge. /// The second sphere to merge. /// The newly constructed bounding sphere. public static BoundingSphere Merge(BoundingSphere value1, BoundingSphere value2) { BoundingSphere result; Merge(ref value1, ref value2, out result); return result; } /// /// Tests for equality between two objects. /// /// The first value to compare. /// The second value to compare. /// /// true if has the same value as ; otherwise, /// false. /// [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool operator ==(BoundingSphere left, BoundingSphere right) { return left.Equals(ref right); } /// /// Tests for inequality between two objects. /// /// The first value to compare. /// The second value to compare. /// /// true if has a different value than ; otherwise, /// false. /// [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool operator !=(BoundingSphere left, BoundingSphere right) { return !left.Equals(ref right); } /// /// Returns a that represents this instance. /// /// /// A that represents this instance. /// public override string ToString() { return string.Format(CultureInfo.CurrentCulture, "Center:{0} Radius:{1}", Center.ToString(), Radius.ToString()); } /// /// Returns a that represents this instance. /// /// The format. /// /// A that represents this instance. /// public string ToString(string format) { if (format == null) return ToString(); return string.Format(CultureInfo.CurrentCulture, "Center:{0} Radius:{1}", Center.ToString(format, CultureInfo.CurrentCulture), Radius.ToString(format, CultureInfo.CurrentCulture)); } /// /// Returns a that represents this instance. /// /// The format provider. /// /// A that represents this instance. /// public string ToString(IFormatProvider formatProvider) { return string.Format(formatProvider, "Center:{0} Radius:{1}", Center.ToString(), Radius.ToString()); } /// /// Returns a that represents this instance. /// /// The format. /// The format provider. /// /// A that represents this instance. /// public string ToString(string format, IFormatProvider formatProvider) { if (format == null) return ToString(formatProvider); return string.Format(formatProvider, "Center:{0} Radius:{1}", Center.ToString(format, formatProvider), Radius.ToString(format, formatProvider)); } /// /// Returns a hash code for this instance. /// /// /// A hash code for this instance, suitable for use in hashing algorithms and data structures like a hash table. /// public override int GetHashCode() { unchecked { return (Center.GetHashCode() * 397) ^ Radius.GetHashCode(); } } /// /// Determines whether the specified is equal to this instance. /// /// The to compare with this instance. /// /// true if the specified is equal to this instance; otherwise, false. /// [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(ref BoundingSphere value) { return (Center == value.Center) && (Radius == value.Radius); } /// /// Determines whether the specified is equal to this instance. /// /// The to compare with this instance. /// /// true if the specified is equal to this instance; otherwise, false. /// [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(BoundingSphere value) { return Equals(ref value); } /// /// Determines whether the specified is equal to this instance. /// /// The to compare with this instance. /// /// true if the specified is equal to this instance; otherwise, false. /// public override bool Equals(object value) { if (!(value is BoundingSphere)) return false; var strongValue = (BoundingSphere)value; return Equals(ref strongValue); } } }