This paper introduces new types of square-piece jigsaw puzzles: those for which the orientation of each jigsaw piece is unknown. We propose a tree-based reassembly that greedily me...
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Sure...
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...