/// <summary> /// /// </summary> /// <param name="x"></param> /// <param name="insertEvent"></param> /// <param name="sweepInt"></param> public SweepLineEvent(double x, SweepLineEvent insertEvent, SweepLineInterval sweepInt) { _xValue = x; _insertEvent = insertEvent; _eventType = insertEvent != null ? SweepLineEventType.Delete : SweepLineEventType.Insert; _sweepInt = sweepInt; }
/// <summary> /// /// </summary> /// <param name="x"></param> /// <param name="insertEvent"></param> /// <param name="sweepInt"></param> public SweepLineEvent(double x, SweepLineEvent insertEvent, SweepLineInterval sweepInt) { _xValue = x; _insertEvent = insertEvent; _eventType = insertEvent != null ? SweepLineEventType.Delete : SweepLineEventType.Insert; _sweepInt = sweepInt; }
/// <summary> /// /// </summary> /// <param name="sweepInt"></param> public virtual void Add(SweepLineInterval sweepInt) { SweepLineEvent insertEvent = new SweepLineEvent(sweepInt.Min, null, sweepInt); _events.Add(insertEvent); _events.Add(new SweepLineEvent(sweepInt.Max, insertEvent, sweepInt)); }
/// <summary> /// /// </summary> /// <param name="start"></param> /// <param name="end"></param> /// <param name="s0"></param> /// <param name="action"></param> private void ProcessOverlaps(int start, int end, SweepLineInterval s0, ISweepLineOverlapAction action) { /* * 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 ev = (SweepLineEvent)_events[i]; if (ev.IsInsert) { SweepLineInterval s1 = ev.Interval; action.Overlap(s0, s1); _nOverlaps++; } } }
/// <summary> /// /// </summary> /// <param name="start"></param> /// <param name="end"></param> /// <param name="s0"></param> /// <param name="action"></param> private void ProcessOverlaps(int start, int end, SweepLineInterval s0, ISweepLineOverlapAction action) { /* * 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 ev = (SweepLineEvent)_events[i]; if (ev.IsInsert) { SweepLineInterval s1 = ev.Interval; action.Overlap(s0, s1); _nOverlaps++; } } }
/// <summary> /// /// </summary> /// <param name="sweepInt"></param> public virtual void Add(SweepLineInterval sweepInt) { SweepLineEvent insertEvent = new SweepLineEvent(sweepInt.Min, null, sweepInt); _events.Add(insertEvent); _events.Add(new SweepLineEvent(sweepInt.Max, insertEvent, sweepInt)); }
/// <summary> /// /// </summary> private void BuildIndex() { _sweepLine = new SweepLineIndex(); for (int i = 0; i < _rings.Count; i++) { LinearRing ring = (LinearRing)_rings[i]; IEnvelope env = ring.EnvelopeInternal; SweepLineInterval sweepInt = new SweepLineInterval(env.Minimum.X, env.Maximum.X, ring); _sweepLine.Add(sweepInt); } }
/// <summary> /// /// </summary> /// <param name="s0"></param> /// <param name="s1"></param> public virtual void Overlap(SweepLineInterval s0, SweepLineInterval s1) { LinearRing innerRing = (LinearRing)s0.Item; LinearRing searchRing = (LinearRing)s1.Item; if (innerRing == searchRing) return; if (_container.IsInside(innerRing, searchRing)) _isNonNested = false; }