Length two path-centred surface areas for the arrangement graph.
Eddie ChengKe QiuZhizhang ShenPublished in: Int. J. Comput. Math. (2014)
Keyphrases
- path length
- shortest path
- solution path
- shortest path problem
- graph structure
- d objects
- fixed length
- graph representation
- three dimensional
- random walk
- graph model
- flat areas
- minimal path
- root node
- surface reconstruction
- graph theoretic
- edge weights
- graph based algorithm
- weighted graph
- hamiltonian path
- graph matching
- graph search
- minimum length
- surface fitting
- spanning tree
- directed acyclic graph