New answers tagged

2 votes

Segmentation of a network at branches from one complex boundary polygon

Here is another possible approach you can explore. You say you have the centreline or can at least build it. The segmentation you seem to want appears to be what I would call Hack Order. RivEX can ...
Hornbydd's user avatar
  • 43.4k
3 votes

Segmentation of a network at branches from one complex boundary polygon

The following algorithm is just based on your test example you asked input for in the comment... so it will need iterations to improve for more/more complex situations, but it shows the main idea I ...
Pieter's user avatar
  • 2,141
5 votes

Segmentation of a network at branches from one complex boundary polygon

Good news you are confident with skeleton creation, good luck. Assuming that you have one: Calculate distance of your nodes to outlet Flip segments if Travel[from]<Travel[to] Path from remotest ...
FelixIP's user avatar
  • 23k
2 votes

Difference between Geodetic Distance and Great Circle Distance?

Geodesic curve: Curve which geodesic curvature is null Geodesics are a family of curves of zero geodesic curvature. On a plane, the geodesic between two points is a line. On a sphere it is an arc of ...
mins's user avatar
  • 227

Top 50 recent answers are included