|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
Noder | Computes all intersections between segments in a set of SegmentString s. |
SegmentIntersector | Computes the intersections between two line segments in SegmentString s
and adds them to each string. |
SegmentStringDissolver.SegmentStringMerger |
Class Summary | |
FastNodingValidator | Validates that a collection of SegmentString s is correctly noded. |
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 . |
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. |
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. |
SegmentString | Represents a list of contiguous line segments, and supports noding the segments. |
SegmentStringDissolver | Dissolves a noded collection of SegmentString s to produce
a set of merged linework with unique segments. |
SimpleNoder | Nodes a set of SegmentString s by
performing a brute-force comparison of every segment to every other one. |
SinglePassNoder | Base class for Noder s which make a single
pass to find intersections. |
Classes to compute nodings for arrangements of line segments and line segment sequences.
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |