Efficient 2-dimensional approximate matching of half-rectangular figures
From MaRDI portal
Recommendations
Cited in
(28)- Real two dimensional scaled matching
- Efficient matching of nonrectangular shapes.
- Overlap matching.
- Embeddings of \(k\)-connected graphs of pathwidth \(k\)
- Approximate swapped matching.
- Approximate congruence in nearly linear time
- Matching fixed rectangles in 2-dimension
- Order-preserving pattern matching indeterminate strings
- \(L_{1}\) pattern matching lower bound
- Modulated string searching
- Order-preserving matching
- Efficient one-dimensional real scaled matching
- Generalized function matching
- Efficient special cases of pattern matching with swaps
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
- A Black Box for Online Approximate Pattern Matching
- 2D Matching Using Repetitive and Salient Features in Architectural Images
- The Complex-Scaled Half-Space Matching Method
- Order-preserving pattern matching indeterminate strings
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
- Approximation algorithms for maximum two-dimensional pattern matching
- The submatrices character count problem: An efficient solution using separable values
- Optimal bounds for distinct quartics
- Reconstructing general matching graphs
- A black box for online approximate pattern matching
- Resource scheduling with variable requirements over time
- Faster two dimensional scaled matching
This page was built for publication: Efficient 2-dimensional approximate matching of half-rectangular figures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1891128)