## Package com.vividsolutions.jts.noding

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

See:
Description

Interface Summary
NodableSegmentString: An interface for classes which support adding nodes to a segment string.
Noder: Computes all intersections between segments in a set of `SegmentString`s.
SegmentIntersector: Processes possible intersections detected by a `Noder`.
SegmentString: An interface for classes which represent a sequence of contiguous line segments.
SegmentStringDissolver.SegmentStringMerger

Class Summary
BasicSegmentString: Represents a list of contiguous line segments, and supports noding the segments.
FastNodingValidator: Validates that a collection of `SegmentString`s is correctly noded.
FastSegmentSetIntersectionFinder: Finds if two sets of `SegmentStrings`s intersect.
InteriorIntersectionFinder: Finds an interior intersection in a set of `SegmentString`s, if one exists.
IntersectionAdder: Computes the intersections between two line segments in `SegmentString`s and adds them to each string.
IntersectionFinderAdder: Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes.
IteratedNoder: Nodes a set of SegmentStrings completely.
MCIndexNoder: Nodes a set of `SegmentStrings` using a index based on `MonotoneChain`s and a `SpatialIndex`.
MCIndexSegmentSetMutualIntersector: Intersects two sets of `SegmentStrings` using a index based on `MonotoneChain`s and a `SpatialIndex`.
NodedSegmentString: Represents a list of contiguous line segments, and supports noding the segments.
NodingValidator: Validates that a collection of `SegmentString`s 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 `SegmentString`s, if one exists.
SegmentNode: Represents an intersection point between two `SegmentString`s.
SegmentNodeList: A list of the `SegmentNode`s present along a noded `SegmentString`.
SegmentPointComparator: Implements a robust method of comparing the relative position of two points along the same segment.
SegmentSetMutualIntersector: An intersector for the red-blue intersection problem.
SegmentStringDissolver: Dissolves a noded collection of `SegmentString`s to produce a set of merged linework with unique segments.
SegmentStringUtil: Utility methods for processing `SegmentString`s.
SimpleNoder: Nodes a set of `SegmentString`s by performing a brute-force comparison of every segment to every other one.
SimpleSegmentSetMutualIntersector: Intersects two sets of `SegmentStrings` using brute-force comparasion.
SinglePassNoder: Base class for `Noder`s which make a single pass to find intersections.

## Package com.vividsolutions.jts.noding Description

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