public static bool GetIntersectionParameters(
Segment2L a,
Segment2L b,
out Point2D[] intersections,
out LongRational[] pArray,
out LongRational[] qArray)
{
Vector2L delta1 = a.GetDelta();
Vector2L delta2 = b.GetDelta();
long denominator = delta1.X * delta2.Y - delta1.Y * delta2.X;
if (denominator == 0L)
{
Segment2L.Struct12 struct12_1 = new Segment2L.Struct12(a.start, a.end, delta1);
Segment2L.Struct12 struct12_2 = new Segment2L.Struct12(b.start, b.end, delta2);
if ((struct12_1.long_0 > struct12_2.long_0 ? (!struct12_1.method_0(b.start) ? 0 : (struct12_1.method_0(b.End) ? 1 : 0)) : (struct12_2.long_0 == 0L || !struct12_2.method_0(a.start) ? 0 : (struct12_2.method_0(a.end) ? 1 : 0))) != 0)
{
if (struct12_1.method_1(b.start))
{
if (struct12_1.method_1(b.end))
{
intersections = new Point2D[2]
{
(Point2D)b.start,
(Point2D)b.end
};
pArray = new LongRational[2]
{
a.GetNormalizedProjection(b.start).Value,
a.GetNormalizedProjection(b.end).Value
};
qArray = new LongRational[2]
{
LongRational.Zero,
LongRational.One
};
return(true);
}
if (struct12_2.method_1(a.start))
{
intersections = new Point2D[2]
{
(Point2D)a.start,
(Point2D)b.start
};
pArray = new LongRational[2]
{
LongRational.Zero,
a.GetNormalizedProjection(b.start).Value
};
qArray = new LongRational[2]
{
b.GetNormalizedProjection(a.start).Value,
LongRational.Zero
};
return(true);
}
if (struct12_2.method_1(a.End))
{
intersections = new Point2D[2]
{
(Point2D)b.start,
(Point2D)a.end
};
pArray = new LongRational[2]
{
a.GetNormalizedProjection(b.start).Value,
LongRational.One
};
qArray = new LongRational[2]
{
LongRational.Zero,
b.GetNormalizedProjection(a.end).Value
};
return(true);
}
}
else if (struct12_1.method_1(b.end))
{
if (struct12_2.method_1(a.start))
{
if (struct12_2.method_1(a.End))
{
intersections = new Point2D[2]
{
(Point2D)a.start,
(Point2D)a.end
};
pArray = new LongRational[2]
{
LongRational.Zero,
LongRational.One
};
qArray = new LongRational[2]
{
b.GetNormalizedProjection(a.start).Value,
b.GetNormalizedProjection(a.end).Value
};
}
else
{
intersections = new Point2D[2]
{
(Point2D)a.start,
(Point2D)b.end
};
pArray = new LongRational[2]
{
LongRational.Zero,
a.GetNormalizedProjection(b.end).Value
};
qArray = new LongRational[2]
{
b.GetNormalizedProjection(a.start).Value,
LongRational.One
};
}
return(true);
}
if (struct12_2.method_1(a.End))
{
intersections = new Point2D[2]
{
(Point2D)a.end,
(Point2D)b.end
};
pArray = new LongRational[2]
{
LongRational.One,
a.GetNormalizedProjection(b.end).Value
};
qArray = new LongRational[2]
{
b.GetNormalizedProjection(a.end).Value,
LongRational.One
};
return(true);
}
}
else if (struct12_2.method_1(a.start))
{
intersections = new Point2D[2]
{
(Point2D)a.start,
(Point2D)a.end
};
pArray = new LongRational[2]
{
LongRational.Zero,
LongRational.One
};
qArray = new LongRational[2]
{
b.GetNormalizedProjection(a.start).Value,
b.GetNormalizedProjection(a.end).Value
};
return(true);
}
}
intersections = (Point2D[])null;
pArray = (LongRational[])null;
qArray = (LongRational[])null;
return(false);
}
long numerator1 = (b.Start.X - a.Start.X) * delta2.Y - (b.Start.Y - a.Start.Y) * delta2.X;
if (denominator > 0L)
{
if (numerator1 < 0L || numerator1 > denominator)
{
intersections = (Point2D[])null;
pArray = (LongRational[])null;
qArray = (LongRational[])null;
return(false);
}
}
else if (numerator1 > 0L || numerator1 < denominator)
{
intersections = (Point2D[])null;
pArray = (LongRational[])null;
qArray = (LongRational[])null;
return(false);
}
long numerator2 = (b.Start.X - a.Start.X) * delta1.Y - (b.Start.Y - a.Start.Y) * delta1.X;
if (denominator > 0L)
{
if (numerator2 < 0L || numerator2 > denominator)
{
intersections = (Point2D[])null;
pArray = (LongRational[])null;
qArray = (LongRational[])null;
return(false);
}
}
else if (numerator2 > 0L || numerator2 < denominator)
{
intersections = (Point2D[])null;
pArray = (LongRational[])null;
qArray = (LongRational[])null;
return(false);
}
LongRational longRational1 = LongRational.Create(numerator1, denominator);
LongRational longRational2 = LongRational.Create(numerator2, denominator);
intersections = new Point2D[1]
{
new Point2D((double)a.start.X + (double)longRational1.Numerator * (double)delta1.X / (double)longRational1.Denominator, (double)a.start.Y + (double)longRational1.Numerator * (double)delta1.Y / (double)longRational1.Denominator)
};
pArray = new LongRational[1] {
longRational1
};
qArray = new LongRational[1] {
longRational2
};
return(true);
}
public static int GetIntersections20Bits(
Segment2L a,
Segment2L b,
out Point2L intersection1,
out Point2L intersection2)
{
Vector2L delta1 = a.GetDelta();
Vector2L delta2 = b.GetDelta();
long num1 = delta1.X * delta2.Y - delta1.Y * delta2.X;
if (num1 == 0L)
{
Segment2L.Struct12 struct12_1 = new Segment2L.Struct12(a.start, a.end, delta1);
Segment2L.Struct12 struct12_2 = new Segment2L.Struct12(b.start, b.end, delta2);
if ((struct12_1.long_0 > struct12_2.long_0 ? (!struct12_1.method_0(b.start) ? 0 : (struct12_1.method_0(b.End) ? 1 : 0)) : (struct12_2.long_0 == 0L || !struct12_2.method_0(a.start) ? 0 : (struct12_2.method_0(a.end) ? 1 : 0))) != 0)
{
if (struct12_1.method_1(b.start))
{
if (struct12_1.method_1(b.end))
{
intersection1 = b.start;
intersection2 = b.end;
return(2);
}
if (struct12_2.method_1(a.start))
{
intersection1 = a.start;
intersection2 = b.start;
return(2);
}
if (struct12_2.method_1(a.End))
{
intersection1 = b.start;
intersection2 = a.end;
return(2);
}
}
else if (struct12_1.method_1(b.end))
{
if (struct12_2.method_1(a.start))
{
if (struct12_2.method_1(a.End))
{
intersection1 = a.start;
intersection2 = a.end;
}
else
{
intersection1 = a.start;
intersection2 = b.end;
}
return(2);
}
if (struct12_2.method_1(a.End))
{
intersection1 = a.end;
intersection2 = b.end;
return(2);
}
}
else if (struct12_2.method_1(a.start))
{
intersection1 = a.start;
intersection2 = a.end;
return(2);
}
}
intersection1 = Point2L.Zero;
intersection2 = Point2L.Zero;
return(0);
}
long num2 = (b.Start.X - a.Start.X) * delta2.Y - (b.Start.Y - a.Start.Y) * delta2.X;
if (num1 > 0L)
{
if (num2 < 0L || num2 > num1)
{
intersection1 = Point2L.Zero;
intersection2 = Point2L.Zero;
return(0);
}
}
else if (num2 > 0L || num2 < num1)
{
intersection1 = Point2L.Zero;
intersection2 = Point2L.Zero;
return(0);
}
long num3 = (b.Start.X - a.Start.X) * delta1.Y - (b.Start.Y - a.Start.Y) * delta1.X;
if (num1 > 0L)
{
if (num3 < 0L || num3 > num1)
{
intersection1 = Point2L.Zero;
intersection2 = Point2L.Zero;
return(0);
}
}
else if (num3 > 0L || num3 < num1)
{
intersection1 = Point2L.Zero;
intersection2 = Point2L.Zero;
return(0);
}
long num4 = num2 * delta1.X;
long num5 = num2 * delta1.Y;
intersection1 = new Point2L(a.start.X + num4 / num1 << 43, a.start.Y + num5 / num1 << 43);
long num6 = num4 % num1;
long num7 = num5 % num1;
double a1 = (double)num6 * 8796093022208.0 / (double)num1;
double a2 = (double)num7 * 8796093022208.0 / (double)num1;
intersection1.X += (long)System.Math.Round(a1);
intersection1.Y += (long)System.Math.Round(a2);
intersection2 = Point2L.Zero;
return(1);
}
public static bool Intersects(Segment2L a, Segment2L b)
{
Vector2L delta1 = a.GetDelta();
Vector2L delta2 = b.GetDelta();
long num1 = delta1.X * delta2.Y - delta1.Y * delta2.X;
if (num1 == 0L)
{
Segment2L.Struct12 struct12_1 = new Segment2L.Struct12(a.start, a.end, delta1);
Segment2L.Struct12 struct12_2 = new Segment2L.Struct12(b.start, b.end, delta2);
if ((struct12_1.long_0 > struct12_2.long_0 ? (!struct12_1.method_0(b.start) ? 0 : (struct12_1.method_0(b.End) ? 1 : 0)) : (struct12_2.long_0 == 0L || !struct12_2.method_0(a.start) ? 0 : (struct12_2.method_0(a.end) ? 1 : 0))) != 0)
{
if (struct12_1.method_1(b.start))
{
if (struct12_1.method_1(b.end) || struct12_2.method_1(a.start) || struct12_2.method_1(a.End))
{
return(true);
}
}
else if (struct12_1.method_1(b.end))
{
if (struct12_2.method_1(a.start) || struct12_2.method_1(a.End))
{
return(true);
}
}
else if (struct12_2.method_1(a.start))
{
return(true);
}
}
return(false);
}
long num2 = (b.Start.X - a.Start.X) * delta2.Y - (b.Start.Y - a.Start.Y) * delta2.X;
if (num1 > 0L)
{
if (num2 < 0L || num2 > num1)
{
return(false);
}
}
else if (num2 > 0L || num2 < num1)
{
return(false);
}
long num3 = (b.Start.X - a.Start.X) * delta1.Y - (b.Start.Y - a.Start.Y) * delta1.X;
if (num1 > 0L)
{
if (num3 < 0L || num3 > num1)
{
return(false);
}
}
else if (num3 > 0L || num3 < num1)
{
return(false);
}
return(true);
}
public static int GetIntersections(
Segment2L a,
Segment2L b,
out Point2D intersection1,
out Point2D intersection2)
{
Vector2L delta1 = a.GetDelta();
Vector2L delta2 = b.GetDelta();
long num1 = delta1.X * delta2.Y - delta1.Y * delta2.X;
if (num1 == 0L)
{
Segment2L.Struct12 struct12_1 = new Segment2L.Struct12(a.start, a.end, delta1);
Segment2L.Struct12 struct12_2 = new Segment2L.Struct12(b.start, b.end, delta2);
if ((struct12_1.long_0 > struct12_2.long_0 ? (!struct12_1.method_0(b.start) ? 0 : (struct12_1.method_0(b.End) ? 1 : 0)) : (struct12_2.long_0 == 0L || !struct12_2.method_0(a.start) ? 0 : (struct12_2.method_0(a.end) ? 1 : 0))) != 0)
{
if (struct12_1.method_1(b.start))
{
if (struct12_1.method_1(b.end))
{
intersection1 = (Point2D)b.start;
intersection2 = (Point2D)b.end;
return(2);
}
if (struct12_2.method_1(a.start))
{
intersection1 = (Point2D)a.start;
intersection2 = (Point2D)b.start;
return(2);
}
if (struct12_2.method_1(a.End))
{
intersection1 = (Point2D)b.start;
intersection2 = (Point2D)a.end;
return(2);
}
}
else if (struct12_1.method_1(b.end))
{
if (struct12_2.method_1(a.start))
{
if (struct12_2.method_1(a.End))
{
intersection1 = (Point2D)a.start;
intersection2 = (Point2D)a.end;
}
else
{
intersection1 = (Point2D)a.start;
intersection2 = (Point2D)b.end;
}
return(2);
}
if (struct12_2.method_1(a.End))
{
intersection1 = (Point2D)a.end;
intersection2 = (Point2D)b.end;
return(2);
}
}
else if (struct12_2.method_1(a.start))
{
intersection1 = (Point2D)a.start;
intersection2 = (Point2D)a.end;
return(2);
}
}
intersection1 = Point2D.NaN;
intersection2 = Point2D.NaN;
return(0);
}
long num2 = (b.Start.X - a.Start.X) * delta2.Y - (b.Start.Y - a.Start.Y) * delta2.X;
if (num1 > 0L)
{
if (num2 < 0L || num2 > num1)
{
intersection1 = Point2D.NaN;
intersection2 = Point2D.NaN;
return(0);
}
}
else if (num2 > 0L || num2 < num1)
{
intersection1 = Point2D.NaN;
intersection2 = Point2D.NaN;
return(0);
}
long num3 = (b.Start.X - a.Start.X) * delta1.Y - (b.Start.Y - a.Start.Y) * delta1.X;
if (num1 > 0L)
{
if (num3 < 0L || num3 > num1)
{
intersection1 = Point2D.NaN;
intersection2 = Point2D.NaN;
return(0);
}
}
else if (num3 > 0L || num3 < num1)
{
intersection1 = Point2D.NaN;
intersection2 = Point2D.NaN;
return(0);
}
intersection1 = new Point2D((double)a.start.X + (double)num2 * (double)delta1.X / (double)num1, (double)a.start.Y + (double)num2 * (double)delta1.Y / (double)num1);
intersection2 = Point2D.NaN;
return(1);
}
