Publication: Coarse-to-fine combinatorial matching for dense isometric shape correspondence
Program
KU-Authors
KU Authors
Co-Authors
Publication Date
Language
Type
Embargo Status
Journal Title
Journal ISSN
Volume Title
Alternative Title
Abstract
We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse-to-fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solution in the minimum-distortion sense for perfectly isometric shapes. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes.
Source
Publisher
Wiley
Subject
Computer science, Software engineering
Citation
Has Part
Source
Computer Graphics Forum
Book Series Title
Edition
DOI
10.1111/j.1467-8659.2011.02020.x