/// <summary>
/// Create a new "split edge" with the section of points between
/// (and including) the two intersections.
/// The label for the new edge is the same as the label for the parent edge.
/// </summary>
/// <param name="ei0"></param>
/// <param name="ei1"></param>
public virtual Edge CreateSplitEdge(EdgeIntersection ei0, EdgeIntersection ei1)
{
int npts = ei1.SegmentIndex - ei0.SegmentIndex + 2;
ICoordinate lastSegStartPt = edge.Points[ei1.SegmentIndex];
// if the last intersection point is not equal to the its segment start pt,
// add it to the points list as well.
// (This check is needed because the distance metric is not totally reliable!)
// The check for point equality is 2D only - Z values are ignored
bool useIntPt1 = ei1.Distance > 0.0 || !ei1.Coordinate.Equals2D(lastSegStartPt);
if (!useIntPt1)
{
npts--;
}
ICoordinate[] pts = new Coordinate[npts];
int ipt = 0;
pts[ipt++] = new Coordinate(ei0.Coordinate);
for (int i = ei0.SegmentIndex + 1; i <= ei1.SegmentIndex; i++)
{
pts[ipt++] = edge.Points[i];
}
if (useIntPt1)
{
pts[ipt] = ei1.Coordinate;
}
return(new Edge(pts, new Label(edge.Label)));
}
/// <summary>
///
/// </summary>
/// <param name="outstream"></param>
public virtual void Write(StreamWriter outstream)
{
outstream.WriteLine("Intersections:");
for (IEnumerator it = GetEnumerator(); it.MoveNext();)
{
EdgeIntersection ei = (EdgeIntersection)it.Current;
ei.Write(outstream);
}
}
/// <summary>
///
/// </summary>
/// <param name="pt"></param>
/// <returns></returns>
public virtual bool IsIntersection(Coordinate pt)
{
for (IEnumerator it = GetEnumerator(); it.MoveNext();)
{
EdgeIntersection ei = (EdgeIntersection)it.Current;
if (ei.Coordinate.Equals(pt))
{
return(true);
}
}
return(false);
}
/// <summary>
/// Adds an intersection into the list, if it isn't already there.
/// The input segmentIndex and dist are expected to be normalized.
/// </summary>
/// <param name="intPt"></param>
/// <param name="segmentIndex"></param>
/// <param name="dist"></param>
/// <returns>The EdgeIntersection found or added.</returns>
public virtual EdgeIntersection Add(ICoordinate intPt, int segmentIndex, double dist)
{
EdgeIntersection eiNew = new EdgeIntersection(intPt, segmentIndex, dist);
EdgeIntersection ei = (EdgeIntersection)nodeMap[eiNew];
if (ei != null)
{
return(ei);
}
nodeMap.Add(eiNew, eiNew);
return(eiNew);
}
/// <summary>
///
/// </summary>
/// <param name="argIndex"></param>
private void AddSelfIntersectionNodes(int argIndex)
{
for (IEnumerator i = edges.GetEnumerator(); i.MoveNext();)
{
Edge e = (Edge)i.Current;
Locations eLoc = e.Label.GetLocation(argIndex);
for (IEnumerator eiIt = e.EdgeIntersectionList.GetEnumerator(); eiIt.MoveNext();)
{
EdgeIntersection ei = (EdgeIntersection)eiIt.Current;
AddSelfIntersectionNode(argIndex, ei.Coordinate, eLoc);
}
}
}
/// <summary>
/// Creates new edges for all the edges that the intersections in this
/// list split the parent edge into.
/// Adds the edges to the input list (this is so a single list
/// can be used to accumulate all split edges for a Geometry).
/// </summary>
/// <param name="edgeList"></param>
public virtual void AddSplitEdges(IList edgeList)
{
// ensure that the list has entries for the first and last point of the edge
AddEndpoints();
IEnumerator it = GetEnumerator();
it.MoveNext();
// there should always be at least two entries in the list
EdgeIntersection eiPrev = (EdgeIntersection)it.Current;
while (it.MoveNext())
{
EdgeIntersection ei = (EdgeIntersection)it.Current;
Edge newEdge = CreateSplitEdge(eiPrev, ei);
edgeList.Add(newEdge);
eiPrev = ei;
}
}
/// <summary>
///
/// </summary>
/// <param name="obj"></param>
/// <returns></returns>
public virtual int CompareTo(object obj)
{
EdgeIntersection other = (EdgeIntersection)obj;
return(Compare(other.SegmentIndex, other.Distance));
}