Package org.locationtech.jts.noding

Classes to compute nodings for arrangements of line segments and line segment sequences.

See: Description

Interface Summary

Interface	Description
NodableSegmentString	An interface for classes which support adding nodes to a segment string.
Noder	Computes all intersections between segments in a set of SegmentStrings.
SegmentIntersector	Processes possible intersections detected by a Noder.
SegmentSetMutualIntersector	An intersector for the red-blue intersection problem.
SegmentString	An interface for classes which represent a sequence of contiguous line segments.
SegmentStringDissolver.SegmentStringMerger	A merging strategy which can be used to update the context data of SegmentStrings which are merged during the dissolve process.

Class Summary

Class	Description
BasicSegmentString	Represents a list of contiguous line segments, and supports noding the segments.
FastNodingValidator	Validates that a collection of SegmentStrings is correctly noded.
FastSegmentSetIntersectionFinder	Finds if two sets of SegmentStrings intersect.
InteriorIntersectionFinderAdder	Finds interior intersections between line segments in NodedSegmentStrings, and adds them as nodes using NodedSegmentString.addIntersection(LineIntersector, int, int, int).
IntersectionAdder	Computes the possible intersections between two line segments in NodedSegmentStrings and adds them to each string using NodedSegmentString.addIntersection(LineIntersector, int, int, int).
IntersectionFinderAdder	Deprecated see InteriorIntersectionFinderAdder
IteratedNoder	Nodes a set of NodedSegmentStrings completely.
MCIndexNoder	Nodes a set of SegmentStrings using a index based on MonotoneChains and a SpatialIndex.
MCIndexNoder.SegmentOverlapAction
MCIndexSegmentSetMutualIntersector	Intersects two sets of SegmentStrings using a index based on MonotoneChains and a SpatialIndex.
MCIndexSegmentSetMutualIntersector.SegmentOverlapAction
NodedSegmentString	Represents a list of contiguous line segments, and supports noding the segments.
NodingIntersectionFinder	Finds non-noded intersections in a set of SegmentStrings, if any exist.
NodingValidator	Validates that a collection of SegmentStrings is correctly noded.
Octant	Methods for computing and working with octants of the Cartesian plane Octants are numbered as follows:
OrientedCoordinateArray	Allows comparing Coordinate arrays in an orientation-independent way.
ScaledNoder	Wraps a Noder and transforms its input into the integer domain.
SegmentIntersectionDetector	Detects and records an intersection between two SegmentStrings, if one exists.
SegmentNode	Represents an intersection point between two SegmentStrings.
SegmentNodeList	A list of the SegmentNodes present along a noded SegmentString.
SegmentPointComparator	Implements a robust method of comparing the relative position of two points along the same segment.
SegmentStringDissolver	Dissolves a noded collection of SegmentStrings to produce a set of merged linework with unique segments.
SegmentStringUtil	Utility methods for processing SegmentStrings.
SimpleNoder	Nodes a set of SegmentStrings by performing a brute-force comparison of every segment to every other one.
SimpleSegmentSetMutualIntersector	Intersects two sets of SegmentStrings using brute-force comparison.
SinglePassNoder	Base class for Noders which make a single pass to find intersections.

Package org.locationtech.jts.noding Description

Classes to compute nodings for arrangements of line segments and line segment sequences.