Department of Computer Engineering2024-11-0920109781-4244-9671-610.1109/SIU.2010.56515552-s2.0-78651443898http://dx.doi.org/10.1109/SIU.2010.5651555https://hdl.handle.net/20.500.14288/9381We address the problem of correspondence between 3D isometric shapes. We present an automatic method that finds the optimal correspondence between two given (nearly) isometric shapes by minimizing the amount of deviation from isometry. We optimize the isometry error in two steps. In the first step, the 3D points uniformly sampled from the shape surfaces are transformed into spectral domain based on geodesic affinity, where the isometry errors are minimized in polynomial time by complete bipartite graph matching. The second step of optimization, which is well-initialized by the resulting correspondence of the first step, explicitly minimizes the isometry cost via an iterative greedy algorithm in the original 3D Euclidean space. Our method is put to test using (nearly) isometric pairs of shapes and its performance is measured via ground-truth correspondence information when available.Computer engineeringConference proceedinghttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78651443898anddoi=10.1109%2fSIU.2010.5651555andpartnerID=40andmd5=bc35c06a8d3573e1180ec2bb8f6aa6e2N/A9378