{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:12Z","timestamp":1725525372064},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_33","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"381-393","source":"Crossref","is-referenced-by-count":3,"title":["Shape Matching by Random Sampling"],"prefix":"10.1007","author":[{"given":"Helmut","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludmila","family":"Scharf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1016\/S0031-3203(01)00099-1","volume":"35","author":"A.S. Aguado","year":"2002","unstructured":"Aguado, A.S., Montiel, E., Nixon, M.S.: Invariant characterisation of the Hough transform for pose estimation of arbitrary shapes. Pattern Recognition\u00a035, 1083\u20131097 (2002)","journal-title":"Pattern Recognition"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01530830","volume":"13","author":"H. Alt","year":"1995","unstructured":"Alt, H., Behrends, B., Bl\u00f6mer, J.: Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence\u00a013, 251\u2013265 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1142\/S0218195995000064","volume":"5","author":"H. Alt","year":"1995","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Internat. J. Comput. Geom. Appl.\u00a05, 75\u201391 (1995)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"33_CR4","volume-title":"Handbook of computational geometry","author":"H. Alt","year":"1999","unstructured":"Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of computational geometry. Elsevier, Amsterdam (1999)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Alt, H., Rote, G., Wenk, C., Efrat, A.: Matching planar maps. J. of Algorithms, 262\u2013283 (2003)","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Alt, H., Scharf, L., Scholz, S.: Probabilistic matching and resemblance evaluation of shapes in trademark images. In: Proc.\u00a0of the 6th ACM International Conference on Image and Video Retrieval, pp.\u00a0533\u2013540 (2007)","DOI":"10.1145\/1282280.1282357"},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/34.75509","volume":"13","author":"E.M. Arkin","year":"1991","unstructured":"Arkin, E.M., Chew, L.P., Huttenlocher, D.P., Kedem, K., Mitchell, J.S.B.: An efficiently computable metric for comparing polygonal shapes. IEEE Trans. Pattern Anal. Mach. Intell.\u00a013(3), 209\u2013216 (1991)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR8","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. In: Proc.\u00a016th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0886\u2013894 (2005)"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Computing roadmaps of semi-algebraic sets. In: Proc.\u00a028th ACM Symposium on Theory of Computing, pp.\u00a0168\u2013173 (1996)","DOI":"10.1145\/237814.237857"},{"key":"33_CR10","unstructured":"Cheong, O., Efrat, A., Har-Peled, S.: On finding a guard that sees most and a shop that sells most. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a01091\u20131100 (2004)"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput.\u00a015(2), 341\u2013363 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10851-006-0647-0","volume":"27","author":"A. Efrat","year":"2007","unstructured":"Efrat, A., Fan, Q., Venkatasubramanian, S.: Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves. J. Math. Imaging Vis.\u00a027(3), 203\u2013216 (2007)","journal-title":"J. Math. Imaging Vis."},{"issue":"6","key":"33_CR13","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"M.A. Fischler","year":"1981","unstructured":"Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM\u00a024(6), 381\u2013395 (1981)","journal-title":"Commun. ACM"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-44438-6_30","volume-title":"Discrete Geometry for Computer Imagery","author":"M. Hagedoorn","year":"2000","unstructured":"Hagedoorn, M., Overmars, M., Veltkamp, R.: A new visibility partition for affine pattern matching. In: Nystr\u00f6m, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol.\u00a01953, pp. 358\u2013370. Springer, Heidelberg (2000)"},{"key":"33_CR15","unstructured":"Latecki, L.J., Veltkamp, R.C.: Properties and performances of shape similarity measures. In: Proc.\u00a0of Int.\u00a0Conf.\u00a0on Data Science and Classification (2006)"},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/1141911.1141924","volume":"25","author":"N.J. Mitra","year":"2006","unstructured":"Mitra, N.J., Guibas, L.J., Pauly, M.: Partial and approximate symmetry detection for 3d geometry. ACM Trans. Graph.\u00a025(3), 560\u2013568 (2006)","journal-title":"ACM Trans. Graph."},{"key":"33_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0734-189X(87)80147-0","volume":"40","author":"G. Stockman","year":"1987","unstructured":"Stockman, G.: Object recognition and localization via pose clustering. Computer Vision, Graphics, and Image Processing\u00a040, 361\u2013387 (1987)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11602613_8","volume-title":"Algorithms and Computation","author":"M. Tanase","year":"2005","unstructured":"Tanase, M., Veltkamp, R.C., Haverkort, H.: Multiple polyline to polygon matching. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 60\u201370. Springer, Heidelberg (2005)"},{"key":"33_CR20","unstructured":"Toft, P.: The Radon Transform - Theory and Implementation. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark (1996)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:07:38Z","timestamp":1558120058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}