I’m developing a program to find the shortest path in an infrastructure network. I’m overlaying road and sewage grids (as lists of LineString objects, etc.), all in EPSG:2180 format. I then perform a “snap to grid” operation on these grids. The grids are passed to an algorithm that identifies intersection points of the LineStrings, and it returns a list of split LineStrings, which I then use to create a graph. The intersection points are added as nodes.