The snap tolerance should be chosen to be as small as possible while still producing a correct result. It probably only needs to be small enough to eliminate "nearly-coincident" segments, for which intersection points cannot be computed accurately. This implies a factor of about 10e-12 smaller than the magnitude of the segment coordinates.
With an appropriate snap tolerance this algorithm appears to be very robust. So far no failure cases have been found, given a small enough snap tolerance.
The correctness of the output is not verified by this noder.
If required this can be done by
|Constructor and Description|
Creates a snapping noder using the given snap distance tolerance.
|Modifier and Type||Method and Description|
Computes the noding for a collection of
public SnappingNoder(double snapTolerance)
snapTolerance- points are snapped if within this distance
public Collection getNodedSubstrings()
Collectionof fully noded
SegmentStrings. The SegmentStrings have the same context as their parent.
public void computeNodes(Collection inputSegStrings)
SegmentStrings. Some Noders may add all these nodes to the input SegmentStrings; others may only add some or none at all.
Copyright © 2020. All rights reserved.