Login / Signup

An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension.

Pascal PréaMathieu RouaultFrançois Brucker
Published in: Electron. Notes Discret. Math. (2017)
Keyphrases
  • arbitrary dimension
  • dynamic programming
  • matching algorithm
  • computationally efficient
  • closed form
  • computational complexity
  • segmentation algorithm
  • energy function
  • higher dimensional
  • graph cuts
  • tree structure