Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input.
Chenglin FanBinhai ZhuPublished in: CoRR (2015)
Keyphrases
- worst case
- upper bound
- high computational complexity
- space complexity
- orders of magnitude
- lower complexity
- computational complexity
- data structure
- lower bound
- computational cost
- learning algorithm
- theoretical analysis
- computationally efficient
- times faster
- search algorithm
- lower and upper bounds
- computer vision
- constant factor
- significant improvement
- branch and bound
- complexity analysis
- discrete data
- genetic algorithm
- polynomial time complexity