Package org.locationtech.jts.noding
package org.locationtech.jts.noding
Classes to compute nodings for arrangements of line segments and line segment sequences.
-
ClassDescriptionRepresents a list of contiguous line segments, and supports noding the segments.Validates that a collection of
SegmentString
s is correctly noded.Finds if two sets ofSegmentString
s intersect.Finds an interior intersection in a set ofSegmentString
s, if one exists.Finds interior intersections between line segments inNodedSegmentString
s, and adds them as nodes usingNodedSegmentString.addIntersection(LineIntersector, int, int, int)
.Computes the possible intersections between two line segments inNodedSegmentString
s and adds them to each string usingNodedSegmentString.addIntersection(LineIntersector, int, int, int)
.Deprecated.see InteriorIntersectionFinderAdderNodes a set ofNodedSegmentString
s completely.An interface for classes which support adding nodes to a segment string.Represents a list of contiguous line segments, and supports noding the segments.Computes all intersections between segments in a set ofSegmentString
s.Validates that a collection ofSegmentString
s is correctly noded.Methods for computing and working with octants of the Cartesian plane Octants are numbered as follows:Allows comparingCoordinate
arrays in an orientation-independent way.Wraps aNoder
and transforms its input into the integer domain.Detects and records an intersection between twoSegmentString
s, if one exists.Processes possible intersections detected by aNoder
.Represents an intersection point between twoSegmentString
s.A list of theSegmentNode
s present along a nodedSegmentString
.Implements a robust method of comparing the relative position of two points along the same segment.An intersector for the red-blue intersection problem.An interface for classes which represent a sequence of contiguous line segments.Dissolves a noded collection ofSegmentString
s to produce a set of merged linework with unique segments.A merging strategy which can be used to update the context data ofSegmentString
s which are merged during the dissolve process.Utility methods for processingSegmentString
s.Nodes a set ofSegmentString
s by performing a brute-force comparison of every segment to every other one.Intersects two sets ofSegmentString
s using brute-force comparison.Base class forNoder
s which make a single pass to find intersections.