Search
Now showing items 1-2 of 2
Tight Relaxation of Quadratic Matching
(The Eurographics Association and John Wiley & Sons Ltd., 2015)
Establishing point correspondences between shapes is extremely challenging as it involves both finding sets of semantically persistent feature points, as well as their combinatorial matching.We focus on the latter and ...
Homotopic Morphing of Planar Curves
(The Eurographics Association and John Wiley & Sons Ltd., 2015)
This paper presents an algorithm for morphing between closed, planar piecewise-C1 curves. The morph is guaranteed to be a regular homotopy, meaning that pinching will not occur in the intermediate curves. The algorithm is ...