1

I´d like to simplify a network of lines by merging small segments into interconnected compartements.

The algorithm should merge the lines based on the smallest cost (degree) at the junction points to the adjacent lines and terminated for a segment when a certain "degree" threshold is reached (See picture). Or in technichal terms:

  1. Select a random line from table where start OR endpoint are not connected to other geometries and assign a unique id.

  2. Generate a path choosing the least cost (best alignment of intersecting/touching lines) at intersections, until defined alignment threshold is reached, then assign created id from 1. to whole path.

  3. Repeat this for remaining segments until all lines have been numbered.

This should be done for the whole dataset and all line vectors included. enter image description here

As an example, there is one plugin describing the process I want in QGis 2.18 called MergeLines, wich simplifies the network structure by alignement but there is no possibility to specify a custom paramter (maximum alignment offset) to define the end of a line segment.

Are there ready tools for that task, preferably using open source solutions like PostGIS/pgRouting? (Something like undirected routing based on alignment as cost?)

mapmap
  • 11
  • 2
  • Welcome to GIS SE. You need to ask for one solution either QGIS or PostGIS. – Padmanabha Jul 28 '23 at 12:20
  • 1
    Would go to postgis and pgrouting though : https://gis.stackexchange.com/questions/432988/simplifying-road-network-with-postgis – Maximilien jaffrès Jul 28 '23 at 12:26
  • Welcome to Geographic Information Systems! Welcome to GIS SE! We're a little different from other sites; this isn't a discussion forum but a Q&A site. Your questions should as much as possible describe not just what you want to do, but precisely what you have tried and where you are stuck trying that. Please check out our short [tour] for more about how the site works – Ian Turton Jul 28 '23 at 12:39

0 Answers0