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 read-only list of contiguous line segments.A noder which extracts chains of boundary segments as
SegmentStrings from a polygonal coverage.A noder which extracts boundary line segments asSegmentStrings.Validates that a collection ofSegmentStrings is correctly noded.Finds if two sets ofSegmentStrings intersect.Finds interior intersections between line segments inNodedSegmentStrings, and adds them as nodes usingNodedSegmentString.addIntersection(LineIntersector, int, int, int).Computes the possible intersections between two line segments inNodedSegmentStrings and adds them to each string usingNodedSegmentString.addIntersection(LineIntersector, int, int, int).Deprecated.see InteriorIntersectionFinderAdderNodes a set ofNodedSegmentStrings 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 ofSegmentStrings.Finds non-noded intersections in a set ofSegmentStrings, if any exist.Validates that a collection ofSegmentStrings is correctly noded.Methods for computing and working with octants of the Cartesian plane Octants are numbered as follows:Allows comparingCoordinatearrays in an orientation-independent way.Wraps aNoderand transforms its input into the integer domain.A noder which extracts all line segments asSegmentStrings.Detects and records an intersection between twoSegmentStrings, if one exists.Processes possible intersections detected by aNoder.Represents an intersection point between twoSegmentStrings.A list of theSegmentNodes 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 ofSegmentStrings to produce a set of merged linework with unique segments.A merging strategy which can be used to update the context data ofSegmentStrings which are merged during the dissolve process.Utility methods for processingSegmentStrings.Nodes a set ofSegmentStrings by performing a brute-force comparison of every segment to every other one.Intersects two sets ofSegmentStrings using brute-force comparison.Base class forNoders which make a single pass to find intersections.A wrapper forNoders which validates the output arrangement is correctly noded.