/// <summary>
///
/// </summary>
/// <param name="start"></param>
/// <param name="end"></param>
/// <param name="ev0"></param>
/// <param name="si"></param>
private void ProcessOverlaps(int start, int end, SweepLineEvent ev0, SegmentIntersector si)
{
SweepLineSegment ss0 = (SweepLineSegment)ev0.Object;
/*
* Since we might need to test for self-intersections,
* include current INSERT event object in list of event objects to test.
* Last index can be skipped, because it must be a Delete event.
*/
for (int i = start; i < end; i++)
{
SweepLineEvent ev1 = _events[i];
if (ev1.IsInsert)
{
SweepLineSegment ss1 = (SweepLineSegment)ev1.Object;
// don't compare edges in same group, if labels are present
if (!ev0.IsSameLabel(ev1))
{
{
ss0.ComputeIntersections(ss1, si);
_nOverlaps++;
}
}
}
}
}
/// <summary>
///
/// </summary>
/// <param name="edge"></param>
/// <param name="edgeSet"></param>
private void Add(Edge edge, object edgeSet)
{
Coordinate[] pts = edge.Coordinates;
for (int i = 0; i < pts.Length - 1; i++)
{
SweepLineSegment ss = new SweepLineSegment(edge, i);
SweepLineEvent insertEvent = new SweepLineEvent(edgeSet, ss.MinX, null);
_events.Add(insertEvent);
_events.Add(new SweepLineEvent(ss.MaxX, insertEvent));
}
}
/// <summary>
///
/// </summary>
/// <param name="ss"></param>
/// <param name="si"></param>
public void ComputeIntersections(SweepLineSegment ss, SegmentIntersector si)
{
si.AddIntersections(edge, ptIndex, ss.edge, ss.ptIndex);
}