On the Computational Complexity of Generalized Common Shape Puzzles.
Mutsunori BanbaraShin-ichi MinatoHirotaka OnoRyuhei UeharaPublished in: CoRR (2023)
Keyphrases
- computational complexity
- np complete
- shape model
- shape representation
- special case
- shape description
- shape features
- shape descriptors
- shape retrieval
- shape matching
- low complexity
- shape recognition
- storage requirements
- memory requirements
- image processing
- computational efficiency
- computational cost
- shape analysis
- constraint satisfaction
- rate distortion
- computationally efficient
- np hard
- arbitrarily shaped