Contour polygonal approximation using shortest path in networks.
André Ricardo BackesDalcimar CasanovaOdemir Martinez BrunoPublished in: CoRR (2013)
Keyphrases
- shortest path
- polygonal approximation
- path length
- shortest path problem
- digital curves
- path selection
- contour points
- shortest path algorithm
- dominant points
- routing algorithm
- source node
- betweenness centrality
- social networks
- edge weights
- weighted graph
- road network
- shortest distance
- travel time
- minimal surface
- small world
- geodesic distance
- complex networks
- network structure
- random walk