public static bool GetSurroundRange(ObjData.vektor obj, ObjData.vektor origo, int range)
{
if (obj.x >= (origo.x - range) && obj.x <= ((origo.x - range) + range * 2) && obj.y >= (origo.y - range) && obj.y <= ((origo.y - range) + range * 2))
{
return(true);
}
return(false);
}
public static double gamedistance(ObjData.vektor p1, ObjData.vektor p2)
{ // Nukei: for test with range checking on objects, maybe faster than only calculating distance
if ((p1.xSec >= p2.xSec - 1) && (p1.xSec <= p2.xSec + 1) && (p1.ySec >= p2.ySec - 1) && (p1.ySec <= p2.ySec + 1))
{
return(gamedistance(p1.x, p1.y, p2.x, p2.y));
}
else
{
return(99999999999999);
}
}
public static bool lineSegmentIntersection(ObjData.vektor Line1_A, ObjData.vektor Line1_B, ObjData.vektor Line2_A, ObjData.vektor Line2_B, ref List <ObjData.vektor> CollisionPoints)
{
// Fail if either line segment is zero-length.
if (Line1_A.x == Line1_B.x && Line1_A.y == Line1_B.y || Line2_A.x == Line2_B.x && Line2_A.y == Line2_B.y)
{
return(false);
}
// Translate the system so that point A is on the origin.
Line1_B.x -= Line1_A.x; Line1_B.y -= Line1_A.y;
Line2_A.x -= Line1_A.x; Line2_A.y -= Line1_A.y;
Line2_B.x -= Line1_A.x; Line2_B.y -= Line1_A.y;
// Discover the length of segment A-B.
float distAB = (float)Math.Sqrt(Line1_B.x * Line1_B.x + Line1_B.y * Line1_B.y);
// Rotate the system so that point B is on the positive X axis.
float theCos = Line1_B.x / distAB;
float theSin = Line1_B.y / distAB;
float newX = Line2_A.x * theCos + Line2_A.y * theSin;
Line2_A.y = Line2_A.y * theCos - Line2_A.x * theSin; Line2_A.x = newX;
newX = Line2_B.x * theCos + Line2_B.y * theSin;
Line2_B.y = Line2_B.y * theCos - Line2_B.x * theSin; Line2_B.x = newX;
// Fail if segment C-D doesn't cross line A-B.
if (Line2_A.y < 0.0f && Line2_B.y < 0.0f || Line2_A.y >= 0.0f && Line2_B.y >= 0.0f)
{
return(false);
}
// Discover the position of the intersection point along line A-B.
float ABpos = Line2_B.x + (Line2_A.x - Line2_B.x) * Line2_B.y / (Line2_B.y - Line2_A.y);
// Fail if segment C-D crosses line A-B outside of segment A-B.
if (ABpos < 0.0f || ABpos > distAB)
{
return(false);
}
// Apply the discovered position to line A-B in the original coordinate system.
ObjData.vektor cp = new ObjData.vektor();
cp.x = Line1_A.x + ABpos * theCos;
cp.y = Line1_A.y + ABpos * theSin;
CollisionPoints.Add(cp);
return(true);
}
// collision detection 2D - /With Linear Algebra/
public static bool isCollided_onMovement(ObjData.vektor fromPos, ObjData.vektor toPos, ref ObjData.vektor CollisionPoint)
{
try
{
fromPos.x = packetx(fromPos.x, fromPos.xSec) / 20.0f;
fromPos.y = packety(fromPos.y, fromPos.ySec) / 20.0f;
toPos.x = packetx(toPos.x, toPos.xSec) / 20.0f;
toPos.y = packety(toPos.y, toPos.ySec) / 20.0f;
// iterated line
ObjData.vektor Line_A = new ObjData.vektor();
ObjData.vektor Line_B = new ObjData.vektor();
List <ObjData.vektor> CollisionPoints = new List <ObjData.vektor>();
// get current region to filter out the objects
short region = makeRegion(fromPos.xSec, fromPos.ySec);
int say = 0;
foreach (var item in ObjData.Manager.MapObject)
{
if (item.Key == region)
{
say++;
}
}
if (say == 0)
{
Console.WriteLine("Pozisyon bulunamadı");
}
// get all entitys in this region and try to cut them with our movement line
foreach (ObjData.SectorObject.n7nEntity obj in ObjData.Manager.MapObject[region].entitys)
{
foreach (ObjData.SectorObject.n7nEntity.sLine line in obj.OutLines)
{
// if not passable
if (line.flag != 0)
{
Line_A.x = obj.Points[line.PointA].x + obj.Position.x;
Line_A.y = obj.Points[line.PointA].y + obj.Position.y;
Line_B.x = obj.Points[line.PointB].x + obj.Position.x;
Line_B.y = obj.Points[line.PointB].y + obj.Position.y;
if (lineSegmentIntersection(fromPos, toPos, Line_A, Line_B, ref CollisionPoints))
{
Console.WriteLine("x:{0} y:{1}", gamex(CollisionPoints[0].x, fromPos.xSec), gamey(CollisionPoints[0].y, fromPos.ySec));
}
}
}
}
if (CollisionPoints.Count == 0)
{
return(false);
}
// set the nearest collision point for return point
double minDistance = gamedistance(fromPos.x, fromPos.y, CollisionPoints[0].x, CollisionPoints[0].y);
foreach (ObjData.vektor cp in CollisionPoints)
{
//double currentDistance = gamedistance(fromPos.x, fromPos.y, cp.x, cp.y);
double currentDistance = gamedistance(fromPos, cp);
if (currentDistance <= minDistance)
{
CollisionPoint.x = cp.x;
CollisionPoint.y = cp.y;
}
}
// translate the collision point on the movement line to get real coordinates (not the exact point of collision)
double sin_alpha = Math.Abs(CollisionPoints[0].y - fromPos.y) / minDistance;
double cos_alpha = Math.Abs(CollisionPoints[0].x - fromPos.x) / minDistance;
CollisionPoints[0].y = (float)(sin_alpha * (minDistance - 3));
CollisionPoints[0].x = (float)(cos_alpha * (minDistance - 3));
}
catch (Exception ex)
{
CLFramework.Log.Exception("Collision detection failed: ", ex);
}
return(true);
}
public static bool lineSegmentIntersection(ObjData.vektor Line1_A, ObjData.vektor Line1_B, ObjData.vektor Line2_A, ObjData.vektor Line2_B, ref List<ObjData.vektor> CollisionPoints)
{
// Fail if either line segment is zero-length.
if (Line1_A.x == Line1_B.x && Line1_A.y == Line1_B.y || Line2_A.x == Line2_B.x && Line2_A.y == Line2_B.y) return false;
// Translate the system so that point A is on the origin.
Line1_B.x -= Line1_A.x; Line1_B.y -= Line1_A.y;
Line2_A.x -= Line1_A.x; Line2_A.y -= Line1_A.y;
Line2_B.x -= Line1_A.x; Line2_B.y -= Line1_A.y;
// Discover the length of segment A-B.
float distAB = (float)Math.Sqrt(Line1_B.x * Line1_B.x + Line1_B.y * Line1_B.y);
// Rotate the system so that point B is on the positive X axis.
float theCos = Line1_B.x / distAB;
float theSin = Line1_B.y / distAB;
float newX = Line2_A.x * theCos + Line2_A.y * theSin;
Line2_A.y = Line2_A.y * theCos - Line2_A.x * theSin; Line2_A.x = newX;
newX = Line2_B.x * theCos + Line2_B.y * theSin;
Line2_B.y = Line2_B.y * theCos - Line2_B.x * theSin; Line2_B.x = newX;
// Fail if segment C-D doesn't cross line A-B.
if (Line2_A.y < 0.0f && Line2_B.y < 0.0f || Line2_A.y >= 0.0f && Line2_B.y >= 0.0f) return false;
// Discover the position of the intersection point along line A-B.
float ABpos = Line2_B.x + (Line2_A.x - Line2_B.x) * Line2_B.y / (Line2_B.y - Line2_A.y);
// Fail if segment C-D crosses line A-B outside of segment A-B.
if (ABpos < 0.0f || ABpos > distAB) return false;
// Apply the discovered position to line A-B in the original coordinate system.
ObjData.vektor cp = new ObjData.vektor();
cp.x = Line1_A.x + ABpos * theCos;
cp.y = Line1_A.y + ABpos * theSin;
CollisionPoints.Add(cp);
return true;
}
// collision detection 2D - /With Linear Algebra/
public static bool isCollided_onMovement(ObjData.vektor fromPos, ObjData.vektor toPos, ref ObjData.vektor CollisionPoint)
{
try
{
fromPos.x = packetx(fromPos.x, fromPos.xSec) / 20.0f;
fromPos.y = packety(fromPos.y, fromPos.ySec) / 20.0f;
toPos.x = packetx(toPos.x, toPos.xSec) / 20.0f;
toPos.y = packety(toPos.y, toPos.ySec) / 20.0f;
// iterated line
ObjData.vektor Line_A = new ObjData.vektor();
ObjData.vektor Line_B = new ObjData.vektor();
List<ObjData.vektor> CollisionPoints = new List<ObjData.vektor>();
// get current region to filter out the objects
short region = makeRegion(fromPos.xSec, fromPos.ySec);
int say = 0;
foreach (var item in ObjData.Manager.MapObject)
{
if (item.Key == region)
{
say++;
}
}
if (say == 0)
{
Console.WriteLine("Pozisyon bulunamadı");
}
// get all entitys in this region and try to cut them with our movement line
foreach (ObjData.SectorObject.n7nEntity obj in ObjData.Manager.MapObject[region].entitys)
{
foreach (ObjData.SectorObject.n7nEntity.sLine line in obj.OutLines)
{
// if not passable
if (line.flag != 0)
{
Line_A.x = obj.Points[line.PointA].x + obj.Position.x;
Line_A.y = obj.Points[line.PointA].y + obj.Position.y;
Line_B.x = obj.Points[line.PointB].x + obj.Position.x;
Line_B.y = obj.Points[line.PointB].y + obj.Position.y;
if (lineSegmentIntersection(fromPos, toPos, Line_A, Line_B, ref CollisionPoints))
{
Console.WriteLine("x:{0} y:{1}", gamex(CollisionPoints[0].x, fromPos.xSec), gamey(CollisionPoints[0].y, fromPos.ySec));
}
}
}
}
if (CollisionPoints.Count == 0) return false;
// set the nearest collision point for return point
double minDistance = gamedistance(fromPos.x, fromPos.y, CollisionPoints[0].x, CollisionPoints[0].y);
foreach (ObjData.vektor cp in CollisionPoints)
{
//double currentDistance = gamedistance(fromPos.x, fromPos.y, cp.x, cp.y);
double currentDistance = gamedistance(fromPos, cp);
if (currentDistance <= minDistance)
{
CollisionPoint.x = cp.x;
CollisionPoint.y = cp.y;
}
}
// translate the collision point on the movement line to get real coordinates (not the exact point of collision)
double sin_alpha = Math.Abs(CollisionPoints[0].y - fromPos.y) / minDistance;
double cos_alpha = Math.Abs(CollisionPoints[0].x - fromPos.x) / minDistance;
CollisionPoints[0].y = (float)(sin_alpha * (minDistance - 3));
CollisionPoints[0].x = (float)(cos_alpha * (minDistance - 3));
}
catch (Exception ex)
{
CLFramework.Log.Exception("Collision detection failed: ", ex);
}
return true;
}
