Rodolà, E.Cosmo, L.Litany, O.Bronstein, M. M.Bronstein, A. M.Audebert, N.Hamza, A. BenBoulch, A.Castellani, U.Do, M. N.Duong, A.-D.Furuya, T.Gasparetto, A.Hong, Y.Kim, J.Saux, B. LeLitman, R.Masoumi, M.Minello, G.Nguyen, H.-D.Nguyen, V.-T.Ohbuchi, R.Pham, V.-K.Phan, T. V.Rezaei, M.Torsello, A.Tran, M.-T.Tran, Q.-T.Truong, B.Wan, L.Zou, C.Ioannis Pratikakis and Florent Dupont and Maks Ovsjanikov2017-04-222017-04-222017978-3-03868-030-71997-0471https://doi.org/10.2312/3dor.20171057https://diglib.eg.org:443/handle/10.2312/3dor20171057Partial similarity problems arise in numerous applications that involve real data acquisition by 3D sensors, inevitably leading to missing parts due to occlusions and partial views. In this setting, the shapes to be retrieved may undergo a variety of transformations simultaneously, such as non-rigid deformations (changes in pose), topological noise, and missing parts - a combination of nuisance factors that renders the retrieval process extremely challenging. With this benchmark, we aim to evaluate the state of the art in deformable shape retrieval under such kind of transformations. The benchmark is organized in two sub-challenges exemplifying different data modalities (3D vs. 2.5D). A total of 15 retrieval algorithms were evaluated in the contest; this paper presents the details of the dataset, and shows thorough comparisons among all competing methods.I.3.5 [Computer Graphics]Computational Geometry and Object ModelingGeometric algorithmslanguagesand systems10.2312/3dor.2017105785-94