-
I would like to get some advice on how to compute intersections between all lines in a collection (or perhaps all lines in two collections). As the intersection points are identified the two input intersecting lines are to be split at the intersection point resulting in four output lines at a crossing or three lines at a mid-segment touching, or no splitting at ends touching. Would I need to decompose LineStrings into Coordinates and use the LineIntersector as a primitive, then reassemble LineStrings as required? Or is there a higher level operator that can assist with this? |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment
-
For a single collection of lines you can use unary union. For two sets of lines use binary union. One limitation is that this does not preserve the parentage of the input lines. If that is required you will need to use a noder such as |
Beta Was this translation helpful? Give feedback.
For a single collection of lines you can use unary union. For two sets of lines use binary union.
One limitation is that this does not preserve the parentage of the input lines. If that is required you will need to use a noder such as
MCIndexNoder
. An example is here.