{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:28:04Z","timestamp":1676978884971},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10115-014-0729-z","type":"journal-article","created":{"date-parts":[[2014,1,11]],"date-time":"2014-01-11T14:47:56Z","timestamp":1389451676000},"page":"157-180","source":"Crossref","is-referenced-by-count":4,"title":["Indexing volumetric shapes with matching and packing"],"prefix":"10.1007","volume":"43","author":[{"given":"David Ryan","family":"Koes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos J.","family":"Camacho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"issue":"3","key":"729_CR1","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.datak.2007.06.001","volume":"63","author":"L Aronovich","year":"2007","unstructured":"Aronovich L, Spiegler I (2007) CM-tree: a dynamic clustered index for similarity search in metric databases. Data Knowl Eng 63(3):919\u2013946","journal-title":"Data Knowl Eng"},{"issue":"2","key":"729_CR2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10115-009-0195-1","volume":"22","author":"L Aronovich","year":"2010","unstructured":"Aronovich L, Spiegler I (2010) Bulk construction of dynamic clustered metric trees. Knowl Inf Syst 22(2):211\u2013244","journal-title":"Knowl Inf Syst"},{"key":"729_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello G (1999) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Berlin"},{"issue":"4","key":"729_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/1118890.1118893","volume":"37","author":"B Bustos","year":"2005","unstructured":"Bustos B, Keim DA, Saupe D, Schreck T, Vrani\u0107 DV (2005) Feature-based similarity search in 3D object databases. ACM Comput Surv 37(4):345\u2013387","journal-title":"ACM Comput Surv"},{"key":"729_CR5","doi-asserted-by":"crossref","unstructured":"Chaouch M, Verroust-Blondet A (2008) A novel method for alignment of 3d models. In: IEEE international conference on shape modeling and applications, 2008. SMI 2008, pp 187\u2013195","DOI":"10.1109\/SMI.2008.4547969"},{"issue":"3","key":"729_CR6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E, Navarro G, Baeza-Yates R, Marroqu\u00edn JL (2001) Searching in metric spaces. ACM Comput Surv 33(3):273\u2013321. doi: 10.1145\/502807.502808","journal-title":"ACM Comput Surv"},{"issue":"4","key":"729_CR7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/1734213.1734218","volume":"57","author":"P Chebolu","year":"2010","unstructured":"Chebolu P, Frieze A (2010) Finding a maximum matching in a sparse random graph in $$O(n)$$ O ( n ) expected time. JACM 57(4):24","journal-title":"JACM"},{"issue":"5","key":"729_CR8","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1107\/S0021889883010985","volume":"16","author":"ML Connolly","year":"1983","unstructured":"Connolly ML (1983) Analytical molecular surface calculation. J Appl Crystallogr 16(5):548\u2013558. doi: 10.1107\/S0021889883010985","journal-title":"J Appl Crystallogr"},{"key":"729_CR9","doi-asserted-by":"crossref","unstructured":"Dong W, Moses C, Li K (2011) Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the international WWW conference, ACM, pp 577\u2013586","DOI":"10.1145\/1963405.1963487"},{"key":"729_CR10","doi-asserted-by":"crossref","unstructured":"Dunbar JB, Smith RD, Yang C-Y, Ung PM-U, Lexa KW, Khazanov NA, Stuckey JA, Wang S, Carlson HA (2011) CSAR benchmark exercise of 2010: selection of the protein-ligand complexes. J Chem Inf Model 51(9), 2036\u20132046. [PubMed: 21728306] [PubMed Central:PMC3180202] [doi: 10.1021\/ci200082t ]. http:\/\/pubs.acs.org\/doi\/abs\/10.1021\/ci200082t","DOI":"10.1021\/ci200082t"},{"issue":"3","key":"729_CR11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees, and flowers. Can J Math 17(3):449\u2013467","journal-title":"Can J Math"},{"issue":"4","key":"729_CR12","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces (survey article). ACM T Datab Syst 28(4):517\u2013580","journal-title":"ACM T Datab Syst"},{"key":"729_CR13","doi-asserted-by":"crossref","unstructured":"Huang N, Shoichet BK, Irwin JJ (2006) Benchmarking sets for molecular docking. J Med Chem 49(23), 6789\u2013801. [PubMed:17154509] [PubMed Central: PMC3383317] [doi: 10.1021\/jm0608356 ]","DOI":"10.1021\/jm0608356"},{"issue":"5","key":"729_CR14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cad.2004.07.002","volume":"37","author":"N Iyer","year":"2005","unstructured":"Iyer N, Jayanti S, Lou K, Kalyanaraman Y, Ramani K (2005) Three-dimensional shape searching: state-of-the-art review and future trends. Comput-Aided Des 37(5):509\u2013530","journal-title":"Comput-Aided Des"},{"key":"729_CR15","unstructured":"Keim DA (1997) Efficient support of similarity search in spatial data bases. Habilitation thesis, University of Munich"},{"key":"729_CR16","doi-asserted-by":"crossref","unstructured":"Keim DA (1999) Efficient geometry-based similarity search of 3D spatial databases. In: Proceedings of the international conference on management of data. ACM, New York, NY, USA, pp 419\u2013430. doi: 10.1145\/304182.304219","DOI":"10.1145\/304182.304219"},{"key":"729_CR17","doi-asserted-by":"crossref","unstructured":"Koes D, Khoury K, Huang Y, Wang W, Bista M, Popowicz GM, Wolf S, Holak TA, D\u00f6mling A, Camacho CJ (2012) Enabling large-scale design, synthesis and validation of small molecule protein-protein antagonists. PLoS ONE 7(3), e32839 EP. [PubMed: 22427896] [PubMed Central: PMC3299697] [doi: 10.1371\/journal.pone.0032839 ]","DOI":"10.1371\/journal.pone.0032839"},{"issue":"1","key":"729_CR18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","volume":"1","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov V (2009) Blossom V: a new implementation of a minimum cost perfect matching algorithm. Math Prog Comput 1(1):43\u201367","journal-title":"Math Prog Comput"},{"key":"729_CR19","unstructured":"Lem (n.d.) LEMON Graph Library, version 1.2.2. http:\/\/lemon.cs.elte.hu"},{"key":"729_CR20","unstructured":"Li B, Godil A, Aono M, Bai X, Furuya T, Li L, L\u00f3pez-Sastre R, Johan H, Ohbuchi R, Redondo-Cabrera C et al (2012) Shrec\u201912 track: Generic 3d shape retrieval. In: Proceedings of the 5th eurographics conference on 3D object retrieval, Eurographics Association, pp 119\u2013126"},{"key":"729_CR21","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Sastre R, Garc\u00eda-Fuertes A, Redondo-Cabrera C, Acevedo-Rodr\u00edguez F, Maldonado-Basc\u00f3n S (2013) Evaluating 3d spatial pyramids for classifying 3d shapes. Comput Graph 37(5), 473\u2013483. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0097849313000551","DOI":"10.1016\/j.cag.2013.04.003"},{"issue":"2","key":"729_CR22","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0146-664X(82)90104-6","volume":"19","author":"D Meagher","year":"1982","unstructured":"Meagher D (1982) Geometric modeling using octree encoding. Comput Graph Image Process 19(2):129\u2013147","journal-title":"Comput Graph Image Process"},{"key":"729_CR23","unstructured":"Mes (n.d.) Meshlab. http:\/\/meshlab.sourceforge.net . Accessed 8 July 2013"},{"key":"729_CR24","unstructured":"Micali S, Vazirani VV (1980) An $$O(\\sqrt{|V|}|E|)$$ O ( | V | | E | ) algorithm for finding maximum matching in general graphs. In: Proceedings of symposium on foundations of computer science. IEEE, pp 17\u201327"},{"key":"729_CR25","unstructured":"Min P (n.d.) binvox. Version 1.17, build #586. http:\/\/www.cs.princeton.edu\/min\/binvox\/ . Accessed 8 July 2013"},{"key":"729_CR26","doi-asserted-by":"crossref","unstructured":"Mokbel MF, Aref WG, Grama A (2003) Spectral LPM: an optimal locality-preserving mapping using the spectral (not fractal) order. In: Proceedings of the international conference on data engineering. IEEE, pp 699\u2013701","DOI":"10.1109\/ICDE.2003.1260840"},{"key":"729_CR27","unstructured":"Mount DM (2010) ANN programming manual, version 1.1.2. http:\/\/www.cs.umd.edu\/mount\/ANN"},{"issue":"2","key":"729_CR28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TVCG.2003.1196006","volume":"9","author":"FS Nooruddin","year":"2003","unstructured":"Nooruddin FS, Turk G (2003) Simplification and repair of polygonal models using volumetric techniques. IEEE Trans Vis Comput Graph 9(2):191\u2013205. doi: 10.1109\/TVCG.2003.1196006","journal-title":"IEEE Trans Vis Comput Graph"},{"key":"729_CR29","doi-asserted-by":"crossref","unstructured":"O\u2019Boyle NM, Banck M, James CA, Morley C, Vandermeersch T, Hutchison GR (2011) Open babel: an open chemical toolbox. J Cheminf 3, 33. [PubMed:21982300] [PubMed Central: PMC3198950] [doi: 10.1186\/1758-2946-3-33 ]","DOI":"10.1186\/1758-2946-3-33"},{"key":"729_CR30","doi-asserted-by":"crossref","unstructured":"Ohbuchi R, Nakazawa M, Takei T (2003) Retrieving 3D shapes based on their appearance. In: Proceedings of the international workshop on multimedia information retrieval, pp 39\u201345","DOI":"10.1145\/973264.973272"},{"issue":"4","key":"729_CR31","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1145\/571647.571648","volume":"21","author":"R Osada","year":"2002","unstructured":"Osada R, Funkhouser T, Chazelle B, Dobkin D (2002) Shape distributions. ACM T Graph 21(4):807\u2013832","journal-title":"ACM T Graph"},{"key":"729_CR32","doi-asserted-by":"crossref","unstructured":"Pagel BU, Six HW, Winter M (1995) Window query-optimal clustering of spatial objects. In: Proceedings of the symposium on principles of database systems. ACM, pp 86\u201394","DOI":"10.1145\/212433.212458"},{"issue":"1","key":"729_CR33","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0923-5965(00)00020-5","volume":"16","author":"E Paquet","year":"2000","unstructured":"Paquet E, Rioux M, Murching A, Naveen T, Tabatabai A (2000) Description of shape information for 2-D and 3-D objects. Signal Process Image Commun 16(1):103\u2013122","journal-title":"Signal Process Image Commun"},{"key":"729_CR34","doi-asserted-by":"crossref","unstructured":"Paredes R, Ch\u00e1vez E, Figueroa K, Navarro G (2006) Practical construction of k-nearest neighbor graphs in metric spaces. In: Experimental Algorithms, pp 85\u201397","DOI":"10.1007\/11764298_8"},{"key":"729_CR35","doi-asserted-by":"crossref","unstructured":"Redondo-Cabrera C, L\u00f3pez-Sastre R, Acevedo-Rodr\u00edguez J, Maldonado-Basc\u00f3n S (2012) Surfing the point clouds: selective 3d spatial pyramids for category-level object recognition. In: IEEE conference on computer vision and pattern recognition (CVPR), 2012, pp 3458\u20133465","DOI":"10.1109\/CVPR.2012.6248087"},{"key":"729_CR36","volume-title":"Foundations of multidimensional and metric data structures","author":"H Samet","year":"2006","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures. Morgan Kaufmann, Los Altos"},{"issue":"3","key":"729_CR37","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/s11263-010-0395-x","volume":"91","author":"K Sfikas","year":"2011","unstructured":"Sfikas K, Theoharis T, Pratikakis I (2011) Rosy+: 3d object pose normalization based on pca and reflective object symmetry with application in 3d object retrieval. Int J Comput Vis 91(3):262\u2013279. doi: 10.1007\/s11263-010-0395-x","journal-title":"Int J Comput Vis"},{"key":"729_CR38","unstructured":"Shr (n.d.) Shrec 2012\u2013shape retrieval contest based on generic 3d dataset. http:\/\/www.itl.nist.gov\/iad\/vug\/sharp\/contest\/2012\/Generic3D\/ . Accessed 8 July 2013"},{"key":"729_CR39","unstructured":"Spr (n.d.) sproxel, r173. http:\/\/code.google.com\/p\/sproxel\/"},{"issue":"3","key":"729_CR40","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s11042-007-0181-0","volume":"39","author":"JWH Tangelder","year":"2008","unstructured":"Tangelder JWH, Veltkamp RC (2008) A survey of content based 3D shape retrieval methods. Multimed Tools Appl 39(3):441\u2013471","journal-title":"Multimed Tools Appl"},{"issue":"1","key":"729_CR41","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0031-3203(00)00120-5","volume":"35","author":"J Vleugels","year":"2002","unstructured":"Vleugels J, Veltkamp RC (2002) Efficient image retrieval through vantage objects. Pattern Recogn 35(1):69\u201380","journal-title":"Pattern Recogn"},{"key":"729_CR42","doi-asserted-by":"crossref","first-page":"034503","DOI":"10.1115\/1.3197846","volume":"9","author":"J Zhang","year":"2009","unstructured":"Zhang J, Smith S (2009) Shape similarity matching with octree representations. J Comput Inf Sci Eng 9:034503","journal-title":"J Comput Inf Sci Eng"},{"key":"729_CR43","doi-asserted-by":"crossref","unstructured":"Zito T, Wilbert N, Wiskott L, Berkes P (2009) Modular toolkit for data processing (mdp): a python data processing framework. Front Neuroinf 2(8). http:\/\/www.frontiersin.org\/neuroinformatics\/10.3389\/neuro.11.008.2008\/abstract","DOI":"10.3389\/neuro.11.008.2008"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0729-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0729-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0729-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T11:09:22Z","timestamp":1565089762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0729-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["729"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0729-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,12]]}}}