| Prev Package | Next Package | Frames | No Frames |
Interface Summary | |
| Noder | Computes all intersections between segments in a set of SegmentStrings. |
| SegmentIntersector | Computes the intersections between two line segments in SegmentStrings
and adds them to each string. |
| SegmentStringDissolver.SegmentStringMerger | |
Class Summary | |
| IntersectionAdder | Computes the intersections between two line segments in SegmentStrings
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 MonotoneChains and a SpatialIndex. |
| MCIndexNoder.SegmentOverlapAction | |
| 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:
\2|1/ 3 \|/ 0 ---+-- 4 /|\ 7 /5|6\ If line segments lie along a coordinate axis, the octant is the lower of the two possible values. |
| OrientedCoordinateArray | Allows comparing Coordinate arrays
in an orientation-independent way. |
| ScaledNoder | Wraps a Noder and transforms its input
into the integer domain. |
| 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. |
| SegmentString | Represents a list of contiguous line segments, and supports noding the segments. |
| SegmentStringDissolver | Dissolves a noded collection of SegmentStrings to produce
a set of merged linework with unique segments. |
| SimpleNoder | Nodes a set of SegmentStrings by
performing a brute-force comparison of every segment to every other one. |
| SinglePassNoder | Base class for Noders which make a single
pass to find intersections. |