Class SimpleMCSweepLineIntersector

Finds all intersections in one or two sets of edges, using an x-axis sweepline algorithm in conjunction with Monotone Chains. While still O(n^2) in the worst case, this algorithm drastically improves the average-case time. The use of MonotoneChains as the items in the index seems to offer an improvement in performance over a sweep-line alone.

Inheritance

Object

EdgeSetIntersector

SimpleMCSweepLineIntersector

Inherited Members

Object.Equals(Object)

Object.Equals(Object, Object)

Object.GetHashCode()

Object.GetType()

Object.MemberwiseClone()

Object.ReferenceEquals(Object, Object)

Object.ToString()

Namespace: NetTopologySuite.GeometriesGraph.Index

Assembly: NetTopologySuite.dll

Syntax

public class SimpleMCSweepLineIntersector : EdgeSetIntersector

Methods

ComputeIntersections(IList<Edge>, SegmentIntersector, Boolean)

Declaration

public override void ComputeIntersections(IList<Edge> edges, SegmentIntersector si, bool testAllSegments)

Parameters

Type	Name	Description
IList<Edge>	edges
SegmentIntersector	si
Boolean	testAllSegments

Overrides

EdgeSetIntersector.ComputeIntersections(IList<Edge>, SegmentIntersector, Boolean)

ComputeIntersections(IList<Edge>, IList<Edge>, SegmentIntersector)

Declaration

public override void ComputeIntersections(IList<Edge> edges0, IList<Edge> edges1, SegmentIntersector si)

Parameters

Type	Name	Description
IList<Edge>	edges0
IList<Edge>	edges1
SegmentIntersector	si

Overrides

EdgeSetIntersector.ComputeIntersections(IList<Edge>, IList<Edge>, SegmentIntersector)