public RectangleE(IntervalE xInt, IntervalE yInt)
{
m_X = xInt.Minimum;
m_Width = xInt.Dimension;
m_Y = yInt.Minimum;
m_Height = yInt.Dimension;
}
public RectangleE Intersect(RectangleE r)
{
IntervalE xIntersect = XInterval.Intersect(r.XInterval);
IntervalE yIntersect = YInterval.Intersect(r.YInterval);
return(new RectangleE(xIntersect, yIntersect));
}
public bool IntersectsWith(IntervalE b)
{
if (b.Minimum <= Minimum)
{
return b.Contains(Minimum);
}
else
{
return b.Contains(Maximum);
}
}
public bool IntersectsWith(IntervalE b)
{
if (b.Minimum <= Minimum)
{
return(b.Contains(Minimum));
}
else
{
return(b.Contains(Maximum));
}
}
public IntervalE Intersect(IntervalE b)
{
if (b.Minimum < Minimum)
{
return(new IntervalE(Minimum, b.Maximum));
}
else
{
return(new IntervalE(b.Minimum, Maximum));
}
}
public IntervalE Intersect(IntervalE b)
{
if (b.Minimum < Minimum)
{
return new IntervalE(Minimum, b.Maximum);
}
else
{
return new IntervalE(b.Minimum, Maximum);
}
}
public RectangleE Union(PointE pt)
{
if (Contains(pt))
{
return(CloneRect());
}
IntervalE xInt = XInterval.Union(pt.X);
RectangleE ans = new RectangleE(xInt, YInterval.Union(pt.Y));
return(ans);
}
public bool Contains(IntervalE testInterval)
{
return testInterval.Minimum >= Minimum && testInterval.Maximum <= Maximum;
}
public IntervalE Union(IntervalE b)
{
return new IntervalE(Math.Min(Minimum, b.Minimum), Math.Max(Maximum, b.Maximum));
}
public bool Contains(IntervalE testInterval)
{
return(testInterval.Minimum >= Minimum && testInterval.Maximum <= Maximum);
}
public IntervalE Union(IntervalE b)
{
return(new IntervalE(Math.Min(Minimum, b.Minimum), Math.Max(Maximum, b.Maximum)));
}
