An algorithm to reduce a river network or other graph-like polygon to a set of lines.
E. I. SchaeferJ. D. PelletierPublished in: Comput. Geosci. (2020)
Keyphrases
- learning algorithm
- initial set
- convex hull
- undirected graph
- detection algorithm
- input data
- finding the shortest path
- graph based algorithm
- random graphs
- minimum spanning tree
- spanning tree
- graph model
- directed graph
- network structure
- segmentation algorithm
- worst case
- computational complexity
- np hard
- neural network
- graph connectivity
- social networks
- polygonal approximation
- fully connected
- graph search
- graph construction
- lower bound
- matching algorithm
- shortest path problem
- dynamic programming
- expectation maximization
- weighted graph
- graph structure
- graph cuts
- tree structure