Package | Description |
---|---|
org.locationtech.jts.geom.prep |
Classes to perform optimized geometric operations on suitably prepared geometries.
|
org.locationtech.jts.noding |
Classes to compute nodings for arrangements of line segments and line segment sequences.
|
org.locationtech.jts.noding.snapround |
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
|
Class | Description |
---|---|
FastSegmentSetIntersectionFinder |
Finds if two sets of
SegmentString s intersect. |
Class | Description |
---|---|
NodableSegmentString |
An interface for classes which support adding nodes to
a segment string.
|
NodedSegmentString |
Represents a list of contiguous line segments,
and supports noding the segments.
|
Noder |
Computes all intersections between segments in a set of
SegmentString s. |
NodingIntersectionFinder |
Finds non-noded intersections in a set of
SegmentString s,
if any exist. |
SegmentIntersectionDetector |
Detects and records an intersection between two
SegmentString s,
if one exists. |
SegmentIntersector |
Processes possible intersections detected by a
Noder . |
SegmentNode |
Represents an intersection point between two
SegmentString s. |
SegmentNodeList |
A list of the
SegmentNode s present along a noded SegmentString . |
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
SegmentString s
which are merged during the dissolve process. |
SinglePassNoder |
Base class for
Noder s which make a single
pass to find intersections. |
Class | Description |
---|---|
NodedSegmentString |
Represents a list of contiguous line segments,
and supports noding the segments.
|
Noder |
Computes all intersections between segments in a set of
SegmentString s. |
SegmentString |
An interface for classes which represent a sequence of contiguous line segments.
|
Copyright © 2018. All rights reserved.