Class: SegmentIntersector

jsts.geomgraph.index.SegmentIntersector

new SegmentIntersector(li, includeProper, recordIsolated)

Computes the intersection of line segments, and adds the intersection to the edges containing the segments.
Parameters:
Name Type Description
li LineIntersector
includeProper boolean
recordIsolated boolean
Source:

Members

numTests :number

testing only
Type:
  • number
Source:

Methods

(static) isAdjacentSegments(i1, i2) → {boolean}

Parameters:
Name Type Description
i1 number
i2 number
Source:
Returns:
Type
boolean

addIntersections(e0, segIndex0, e1, segIndex1)

This method is called by clients of the EdgeIntersector class to test for and add intersections for two segments of the edges being intersected. Note that clients (such as MonotoneChainEdges) may choose not to intersect certain pairs of segments for efficiency reasons.
Parameters:
Name Type Description
e0 Edge
segIndex0 int
e1 Edge
segIndex1 int
Source:

getProperIntersectionPoint() → {Coordinate}

Source:
Returns:
the proper intersection point, or null if none was found.
Type
Coordinate

hasIntersection() → {boolean}

Source:
Returns:
Type
boolean

hasProperInteriorIntersection() → {boolean}

A proper interior intersection is a proper intersection which is not contained in the set of boundary nodes set for this jsts.geomgraph.index.SegmentIntersector.
Source:
Returns:
Type
boolean

hasProperIntersection() → {boolean}

A proper intersection is an intersection which is interior to at least two line segments. Note that a proper intersection is not necessarily in the interior of the entire Geometry, since another edge may have an endpoint equal to the intersection, which according to SFS semantics can result in the point being on the Boundary of the Geometry.
Source:
Returns:
Type
boolean

isTrivialIntersection(e0, segIndex0, e1, segIndex1) → {boolean}

A trivial intersection is an apparent self-intersection which in fact is simply the point shared by adjacent line segments. Note that closed edges require a special check for the point shared by the beginning and end segments.
Parameters:
Name Type Description
e0 Edge
segIndex0 int
e1 Edge
segIndex1 int
Source:
Returns:
Type
boolean

setBoundaryNodes(bdyNodes0, bdyNodes1)

Parameters:
Name Type Description
bdyNodes0 javascript.util.Collection
bdyNodes1 javascript.util.Collection
Source: