{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:36:28Z","timestamp":1742387788186},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_11","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:26:17Z","timestamp":1186727177000},"page":"36-45","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Algorithm for Point Set Pattern Matching under Rigid Motion"],"prefix":"10.1007","author":[{"given":"Arijit","family":"Bishnu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhargab B.","family":"Bhattacharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"P. K. Agarwal","year":"1998","unstructured":"P. K. Agarwal and M. Sharir, Efficient Algorithm for Geometric Optimization, ACM Computing Surveys, vol. 30, No. 4, pp. 412\u2013458, 1998.","journal-title":"ACM Computing Surveys"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/BF01187037","volume":"9","author":"P. K. Agarwal","year":"1993","unstructured":"P. K. Agarwal, B. Aronov, M. Sharir and S. Suri, Selecting Distances in the Plane, Algorithmica, vol. 9, pp. 495\u2013514, 1993.","journal-title":"Algorithmica"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/PL00009388","volume":"20","author":"T. Akutsu","year":"1998","unstructured":"T. Akutsu, H. Tamaki, and T. Tokuyama, Distribution of Distances and Triangles in a Plane Set and Algorithms for Computing the Largest Common Point Sets, Discrete Computational Geometry, vol. 20, pp. 307\u2013331, 1998.","journal-title":"Discrete Computational Geometry"},{"key":"11_CR4","series-title":"Technical Report B","volume-title":"Discrete Geometric Shapes: Matching, Interpolation, and Approximation \u2014 A Survey","author":"H. Alt","year":"1996","unstructured":"H. Alt and L. J. Guibas, Discrete Geometric Shapes: Matching, Interpolation, and Approximation \u2014 A Survey, Technical Report B 96-11, Freie Universit\u00e4t Berlin, 1996."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"H. Alt, B. Behrends, and J. Bl\u00f6mer, Approximate Matching of Polygonal Shapes, in Proc. ACM Symposium on Computational Geometry, pp. 186\u2013193, 1991.","DOI":"10.1145\/109648.109669"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H. Alt","year":"1988","unstructured":"H. Alt, K. Mehlhorn, H. Wagener, and E. Welzl, Congruence, Similarity and Symmetries of Geometric Objects, Discrete Computational Geometry, vol. 3, pp. 237\u2013256, 1988.","journal-title":"Discrete Computational Geometry"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0196-6774(87)90036-8","volume":"8","author":"M. D. Atkinson","year":"1987","unstructured":"M. D. Atkinson, An Optimal Algorithm for Geometrical Congruence, J. Algorithms, vol. 8, pp. 159\u2013172, 1987.","journal-title":"J. Algorithms"},{"key":"11_CR8","unstructured":"A. Bishnu, P. Bhowmick, J. Dey, B. B. Bhattacharya, M. K. Kundu, C. A. Murthy, and T. Acharya, Combinatorial Classification of Pixels for Ridge Extraction in a Gray-scale Fingerprint Image, accepted in: The 3rd Indian Conference on Computer Vision, Graphics and Image Processing, Ahmedabad, India, Dec. 2002."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0097-3165(84)90047-5","volume":"37","author":"J. Beck","year":"1984","unstructured":"J. Beck and J. Spencer, Unit Distances, J. Combinatorial Theory A, vol. 37, pp. 231\u2013238, 1984.","journal-title":"J. Combinatorial Theory A"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"G. T. Candela, P. J. Grother, C. I. Watson, R. A. Wilkinson, and C. L. Wilson, PCAzSYS \u2014 A Pattern-Level Classification Automation System for Fingerprints, NISTIR 5647, National Institute of Standards and Technology, August 1995.","DOI":"10.6028\/NIST.IR.5647"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/S0031-3203(98)00107-1","volume":"32","author":"A. Farina","year":"1999","unstructured":"A. Farina, Zs. M. Kovacs-Vajna, and A. Leone, Fingerprint Minutiae Extraction from Skeletonized Binary Images, Pattern Recognition, vol. 32, pp. 877\u2013889, 1999.","journal-title":"Pattern Recognition"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1109\/34.99233","volume":"13","author":"D. Forsyth","year":"1991","unstructured":"D. Forsyth, J. L. Mundy, A. Zisserman, C. Coelho, A. Heller, and C. Rothwell, Invariant Descriptors for 3-D Object Recognition and Pose, IEEE Trans. PAMI, vol. 13, pp. 971\u2013991, 1991.","journal-title":"IEEE Trans. PAMI"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"M. Gavrilov, P. Indyk, R. Motwani, and S. Venkatasubramanian, Geometric Pattern Matching: A Performance Study, in Proc. ACM Symposium on Computational Geometry, pp. 79\u201385, 1999.","DOI":"10.1145\/304893.304916"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"J. E. Goodman","year":"1983","unstructured":"J. E. Goodman and R. Pollack, Multidimensional Sorting, SIAM Journal on Computing, vol. 12, pp. 484\u2013507, 1983.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"11_CR15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/34.761267","volume":"21","author":"M. T. Goodrich","year":"1999","unstructured":"M. T. Goodrich, J. S. B. Mitchell, and M. W. Orletsky, Approximate Geometric Pattern Matching under Rigid Motions, IEEE Trans. PAMI, vol. 21, No. 4, pp. 371\u2013379, April, 1999.","journal-title":"IEEE Trans. PAMI"},{"key":"11_CR16","first-page":"1426","volume":"19","author":"R. M. Haralick","year":"1989","unstructured":"R. M. Haralick, C. N. Lee, X. Zhuang, V. G. Vaidya, and M. B. Kim, Pose Estimation from Corresponding Point Data, IEEE Trans. SMC, vol. 19, pp. 1426\u20131446, 1989.","journal-title":"IEEE Trans. SMC"},{"key":"11_CR17","unstructured":"S. Jozsa and E. Szemeredi, The Number of Unit Distances on the Plane, in: Infinite and Finite Sets Coll. Math. Soc. J. Bolyai, vol. 10, pp. 939\u2013950, 1973."},{"key":"11_CR18","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley Publishing Company, Inc., 1973."},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth Jr.","year":"1977","unstructured":"D. E. Knuth, Jr. J. H. Morris, and V. R. Pratt, Fast Pattern Matching in Strings, SIAM J. on Computing, vol. 6, no. 2, pp. 240\u2013267, 1977.","journal-title":"SIAM J. on Computing"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","volume":"21","author":"D. T. Lee","year":"1985","unstructured":"D. T. Lee and Y. T. Ching, The Power of Geometric Duality Revisited, Inform. Process. Lett., vol 21, pp. 117\u2013122, 1985.","journal-title":"Inform. Process. Lett."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(94)00190-A","volume":"53","author":"J. Matousek","year":"1995","unstructured":"J. Matousek, On Enclosing k Points by a Circle, Information Processing Letters, vol. 53, pp. 217\u2013221, 1995.","journal-title":"Information Processing Letters"},{"key":"11_CR22","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms, J. Assoc. Comput. Mach, vol 30, pp. 852\u2013865, 1983.","journal-title":"J. Assoc. Comput. Mach"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF01293487","volume":"13","author":"P. J. Rezende","year":"1995","unstructured":"P. J. Rezende and D. T. Lee, Point Set Pattern Matching in d-dimensions, Algorithmica, vol. 13, pp. 387\u2013404, 1995.","journal-title":"Algorithmica"},{"key":"11_CR24","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1017\/S0963548397002976","volume":"6","author":"L. Szekely","year":"1997","unstructured":"L. Szekely, Crossing numbers and Hard Erd\u00f6s Problems in Discrete Geometry, Combinatorics, Probability and Computing, vol. 6, pp. 353\u2013358, 1997.","journal-title":"Combinatorics, Probability and Computing"},{"key":"11_CR25","first-page":"293","volume-title":"Graph Theory and Combinatorics","author":"J. Spencer","year":"1984","unstructured":"J. Spencer, E. Szemeredi, and W. T. Trotter, Unit Distances in the Euclidean Plane, in: Graph Theory and Combinatorics (B. Bollobas ed.) Academic Press, London, pp. 293\u2013308, 1984."},{"key":"11_CR26","unstructured":"C. I. Watson, Mated Fingerprint Card Pairs 2, Technical Report Special Database 14, MFCP2, National Institute of Standards and Technology, September 1993."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:12:25Z","timestamp":1556734345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}