Class SimpleSweepLineIntersector

Namespace

NetTopologySuite.GeometriesGraph.Index

Assembly

NetTopologySuite.dll

Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm. While still O(n^2) in the worst case, this algorithm drastically improves the average-case time.

public class SimpleSweepLineIntersector : EdgeSetIntersector

Inheritance

object

EdgeSetIntersector

SimpleSweepLineIntersector

Inherited Members

object.GetType()

object.MemberwiseClone()

object.ToString()

object.Equals(object)

object.Equals(object, object)

object.ReferenceEquals(object, object)

object.GetHashCode()

Constructors

SimpleSweepLineIntersector()

public SimpleSweepLineIntersector()

Methods

ComputeIntersections(IList<Edge>, SegmentIntersector, bool)

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

Parameters

edges IList<Edge>

si SegmentIntersector

testAllSegments bool

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

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

Parameters

edges0 IList<Edge>

edges1 IList<Edge>

si SegmentIntersector