virtualx-engine/modules/mono/glue/cs_files/Plane.cs
2018-04-29 13:40:15 +02:00

214 lines
4.8 KiB
C#

using System;
#if REAL_T_IS_DOUBLE
using real_t = System.Double;
#else
using real_t = System.Single;
#endif
namespace Godot
{
public struct Plane : IEquatable<Plane>
{
Vector3 normal;
public real_t x
{
get
{
return normal.x;
}
set
{
normal.x = value;
}
}
public real_t y
{
get
{
return normal.y;
}
set
{
normal.y = value;
}
}
public real_t z
{
get
{
return normal.z;
}
set
{
normal.z = value;
}
}
real_t d;
public Vector3 Center
{
get
{
return normal * d;
}
}
public real_t DistanceTo(Vector3 point)
{
return normal.Dot(point) - d;
}
public Vector3 GetAnyPoint()
{
return normal * d;
}
public bool HasPoint(Vector3 point, real_t epsilon = Mathf.Epsilon)
{
real_t dist = normal.Dot(point) - d;
return Mathf.Abs(dist) <= epsilon;
}
public Vector3 Intersect3(Plane b, Plane c)
{
real_t denom = normal.Cross(b.normal).Dot(c.normal);
if (Mathf.Abs(denom) <= Mathf.Epsilon)
return new Vector3();
Vector3 result = b.normal.Cross(c.normal) * d +
c.normal.Cross(normal) * b.d +
normal.Cross(b.normal) * c.d;
return result / denom;
}
public Vector3 IntersectRay(Vector3 from, Vector3 dir)
{
real_t den = normal.Dot(dir);
if (Mathf.Abs(den) <= Mathf.Epsilon)
return new Vector3();
real_t dist = (normal.Dot(from) - d) / den;
// This is a ray, before the emitting pos (from) does not exist
if (dist > Mathf.Epsilon)
return new Vector3();
return from + dir * -dist;
}
public Vector3 IntersectSegment(Vector3 begin, Vector3 end)
{
Vector3 segment = begin - end;
real_t den = normal.Dot(segment);
if (Mathf.Abs(den) <= Mathf.Epsilon)
return new Vector3();
real_t dist = (normal.Dot(begin) - d) / den;
if (dist < -Mathf.Epsilon || dist > 1.0f + Mathf.Epsilon)
return new Vector3();
return begin + segment * -dist;
}
public bool IsPointOver(Vector3 point)
{
return normal.Dot(point) > d;
}
public Plane Normalized()
{
real_t len = normal.Length();
if (len == 0)
return new Plane(0, 0, 0, 0);
return new Plane(normal / len, d / len);
}
public Vector3 Project(Vector3 point)
{
return point - normal * DistanceTo(point);
}
// Constructors
public Plane(real_t a, real_t b, real_t c, real_t d)
{
normal = new Vector3(a, b, c);
this.d = d;
}
public Plane(Vector3 normal, real_t d)
{
this.normal = normal;
this.d = d;
}
public Plane(Vector3 v1, Vector3 v2, Vector3 v3)
{
normal = (v1 - v3).Cross(v1 - v2);
normal.Normalize();
d = normal.Dot(v1);
}
public static Plane operator -(Plane plane)
{
return new Plane(-plane.normal, -plane.d);
}
public static bool operator ==(Plane left, Plane right)
{
return left.Equals(right);
}
public static bool operator !=(Plane left, Plane right)
{
return !left.Equals(right);
}
public override bool Equals(object obj)
{
if (obj is Plane)
{
return Equals((Plane)obj);
}
return false;
}
public bool Equals(Plane other)
{
return normal == other.normal && d == other.d;
}
public override int GetHashCode()
{
return normal.GetHashCode() ^ d.GetHashCode();
}
public override string ToString()
{
return String.Format("({0}, {1})", new object[]
{
normal.ToString(),
d.ToString()
});
}
public string ToString(string format)
{
return String.Format("({0}, {1})", new object[]
{
normal.ToString(format),
d.ToString(format)
});
}
}
}