Class: SimpleEdgeSetIntersector

jsts.geomgraph.index.SimpleEdgeSetIntersector

new SimpleEdgeSetIntersector()

Finds all intersections in one or two sets of edges, using the straightforward method of comparing all segments. This algorithm is too slow for production use, but is useful for testing purposes.
Source:

Members

nOverlaps :int

statistics information
Type:
  • int
Source:

Methods

computeIntersections(edges, si, testAllSegments)

Parameters:
Name Type Description
edges javascript.util.List
si SegmentIntersector
testAllSegments boolean
Source:

computeIntersections2(edges0, edges1, si)

Parameters:
Name Type Description
edges0 javascript.util.List
edges1 javascript.util.List
si SegmentIntersector
Source:

computeIntersects(e0, e1, si)

Performs a brute-force comparison of every segment in each Edge. This has n^2 performance, and is about 100 times slower than using monotone chains.
Parameters:
Name Type Description
e0 Edge
e1 Edge
si SegmentIntersector
Source: