예제 #1
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public float AngleBetweenFirstQuadrant(V3 v) {
			theta = AngleBetween(v);
			if (theta > PiBy2) return theta - PiBy2;
			else return theta;
		}
예제 #2
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public bool IsOrthogonalTo(V3 v) {
			if (this.AngleBetween(v) == (Math.PI / 2D)) return true;
			else return false;
		}
예제 #3
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public static float DotProduct(V3 v1, V3 v2) {
			return v1.X * v2.X + v1.Y * v2.Y + v1.Z * v2.Z; //dot product
		}
예제 #4
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public float AngleBetween(V3 v) {
			if (this.Magnitude == 0 || v.Magnitude == 0) return 0;
			return (float)Math.Acos((this.UnitVector * v.UnitVector));
		}
예제 #5
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public void CrossProduct(V3 other) {
			V3.CrossProduct(this, other);
		}
예제 #6
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public float DotProduct(V3 other) {
			return DotProduct(this, other);
		}
예제 #7
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public static V3 Perpendicular2DLeftHanded(V3 v) {
			return new V3(v.Y, -v.X, 0);
		}
예제 #8
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public void ProjectOnTo(V3 v) {
			float d = ProjectionDistance(v);
			this.Set(v.UnitVector * d);
		}
예제 #9
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public static V3 New(V3 v) {
			return new V3(v);
		}
예제 #10
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public static float Mag(V3 v) { //rename to distance to origin
			return (float)Math.Sqrt(v.X * v.X + v.Y * v.Y + v.Z * v.Z);
		}
예제 #11
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public float ProjectionDistance(V3 v) {
			return (this * v.UnitVector);
		}
예제 #12
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public V3 Project(V3 v) {
			this.ProjectOnTo(v);
			return this;
		}
예제 #13
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public V3(V3 v) : base((P3)v) { }
예제 #14
0
파일: Mesh.cs 프로젝트: xstos/alithiatec
        /// <summary>
        /// returns the new position after a 'deltaTimeInSec'-long time increment
        /// </summary>
        public P3 NextPoint(float deltaTimeInSec)
        {
            V3 distance = Velocity * deltaTimeInSec;             //d=vt (*=scalar mult)

            return(position + distance);
        }
예제 #15
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public static V3 CrossProduct(V3 a, V3 b) {
			return new V3(a.Y * b.Z - a.Z * b.Y, a.Z * b.X - a.X * b.Z, a.X * b.Y - a.Y * b.X);
		}
예제 #16
0
        //http://www.gamedev.net/reference/articles/article1026.asp
        void collideWithWorld(Mesh2D projectile, float deltaTimeInSec)
        {
            P3 sourcePoint    = projectile.Position;
            V3 velocityVector = projectile.Velocity.Clone() * deltaTimeInSec;
            // How far do we need to go?
            float distanceToTravel = velocityVector.Magnitude;             //length of velocityVector;

            // Do we need to bother?
            if (distanceToTravel < float.Epsilon)
            {
                return;
            }
            // What's our destination?
            P3 destinationPoint = sourcePoint + velocityVector;
            // Whom might we collide with?
            List <Mesh2D> potentialColliders = null;          //= GetObstacles(projectile);

            // If there are none, we can safely move to the destination and bail
            if (potentialColliders.Count == 0)
            {
                projectile.MoveNext(deltaTimeInSec);
                return;
            }
            // Determine the nearest collider from the list potentialColliders
            bool   firstTimeThrough                = true;
            float  nearestDistance                 = -1.0F;
            Mesh2D nearestCollider                 = null;
            P3     nearestIntersectionPoint        = null;
            P3     nearestPolygonIntersectionPoint = null;

            for (int i = 0; i < potentialColliders.Count; i++)
            {
                // Plane origin/normal
                P3 pOrigin = potentialColliders[i].Vertices[0];                                  //any vertex from the current polygon;
                V3 pNormal = potentialColliders[i].Edges[0].GetNormal2DRightHanded().UnitVector; //surface normal from the current polygon;
                // Determine the distance from the plane to the source
                float pDist = intersect(sourcePoint, -pNormal, pOrigin, pNormal);
                //P3 sphereIntersectionPoint;
                P3 planeIntersectionPoint;
                // The radius of the ellipsoid (in the direction of pNormal)
                //V3 directionalRadius = -pNormal * new V3(projectile.BoundingRadius, projectile.BoundingRadius, 0);
                float radius = projectile.BoundingRadius;                 //directionalRadius.Magnitude;
                // Is the plane embedded?
                if (Math.Abs(pDist) <= radius)
                {
                    // Calculate the plane intersection point
                    V3 pN = -pNormal;
                    pN.Magnitude           = pDist;           //-pNormal with length set to pDist
                    planeIntersectionPoint = sourcePoint + pN;
                }
                else
                {
                    // Calculate the ellipsoid intersection point
                    V3 pN = -pNormal;
                    pN.Magnitude = radius;                     //-pNormal with length set to radius
                    P3 ellipsoidIntersectionPoint = sourcePoint + pN;
                    // Calculate the plane intersection point
                    //Ray    ray(sphereIntersectionPoint, Velocity);
                    float tt = intersect(ellipsoidIntersectionPoint, velocityVector, pOrigin, pNormal);
                    // Calculate the plane intersection point
                    V3 VV = velocityVector.Clone();
                    VV.Magnitude           = tt;           // velocityVector with length set to t;
                    planeIntersectionPoint = ellipsoidIntersectionPoint + VV;
                }
                // Unless otherwise stated, our polygonIntersectionPoint is the
                // same point as planeIntersectionPoint

                P3 polygonIntersectionPoint = planeIntersectionPoint.Clone();
                // So… are they the same?
                if (!potentialColliders[i].Contains(planeIntersectionPoint))                                       //planeIntersectionPoint is not within the current polygon)
                {
                    polygonIntersectionPoint = P3.Closest(potentialColliders[i].Vertices, planeIntersectionPoint); //nearest point on polygon's perimeter to planeIntersectionPoint;
                }
                // Invert the velocity vector
                V3 negativeVelocityVector = -velocityVector;
                // Using the polygonIntersectionPoint, we need to reverse-intersect
                // with the ellipsoid
                float t = intersectSphere(polygonIntersectionPoint, negativeVelocityVector, sourcePoint, projectile.BoundingRadius);
                // Was there an intersection with the ellipsoid?
                if (t >= 0.0F && t <= distanceToTravel)
                {
                    V3 VV = negativeVelocityVector.Clone();                     //negativeVelocityVector with length set to t;
                    VV.Magnitude = t;
                    // Where did we intersect the ellipsoid?
                    V3 intersectionPoint = (polygonIntersectionPoint + VV).ToV3();
                    // Closest intersection thus far?
                    if (firstTimeThrough || t < nearestDistance)
                    {
                        nearestDistance                 = t;
                        nearestCollider                 = potentialColliders[i];
                        nearestIntersectionPoint        = intersectionPoint;
                        nearestPolygonIntersectionPoint = polygonIntersectionPoint;
                        firstTimeThrough                = false;
                    }
                }
            }
            // If we never found a collision, we can safely move to the destination
            // and bail
            if (firstTimeThrough)
            {
                projectile.MoveNext(deltaTimeInSec);
                return;
            }
            // Move to the nearest collision
            V3 V = velocityVector.Clone();             //velocityVector with length set to (nearestDistance - EPSILON);

            V.Magnitude = nearestDistance;
            sourcePoint = sourcePoint + V;

            // Determine the sliding plane (we do this now, because we're about to
            // change sourcePoint)
            P3 slidePlaneOrigin = nearestPolygonIntersectionPoint;
            V3 slidePlaneNormal = new V3(nearestPolygonIntersectionPoint, sourcePoint);
            // We now project the destination point onto the sliding plane
            float time = intersect(destinationPoint, slidePlaneNormal, slidePlaneOrigin, slidePlaneNormal);
            //Set length of slidePlaneNormal to time;
            V3 destinationProjectionNormal = slidePlaneNormal;
            P3 newDestinationPoint         = destinationPoint + destinationProjectionNormal;
            // Generate the slide vector, which will become our new velocity vector
            // for the next iteration
            V3 newVelocityVector = new V3(newDestinationPoint, nearestPolygonIntersectionPoint);

            // Recursively slide (without adding gravity)
            projectile.Position = sourcePoint;
            projectile.Velocity = newVelocityVector;
            collideWithWorld(projectile, deltaTimeInSec);
        }
예제 #17
0
파일: V3.cs 프로젝트: xstos/alithiatec
		public bool IsOrthogonalTo(V3 v, float epsilon) {
			if (Math.Abs(this.AngleBetween(v) - (Math.PI / 2D)) < epsilon)
				return true;
			else return false;
		}