Login / Signup
Complexity of Matching Sets of Two-Dimensional Patterns by Two-Dimensional On-Line Tessellation Automaton.
Daniel Prusa
Published in:
Int. J. Found. Comput. Sci. (2017)
Keyphrases
</>
three dimensional
computational complexity
computational cost
multi dimensional
keypoints
graph matching
matching process
image segmentation
worst case
matching algorithm