{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:19Z","timestamp":1725663379774},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_45","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:12Z","timestamp":1330201932000},"page":"213-228","source":"Crossref","is-referenced-by-count":1,"title":["Linear time algorithms for testing approximate congruence in the plane"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Iwanowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974","key":"14_CR1"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02187910","volume":"3","author":"H. Alt","year":"1988","unstructured":"H. Alt, K. Mehlhorn, H. Wagener, E. Welzl: Congruence, Similarity and Symmetries of Geometric Objects, Discr. Comp. Geom. 3 (1988), pp.237\u2013256","journal-title":"Discr. Comp. Geom."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00977833","volume":"13","author":"M.J. Atallah","year":"1984","unstructured":"M.J. Atallah: Checking Similarity of Planar Figures, International J. Comp. Inf. Science 13 (1984), pp. 279\u2013290.","journal-title":"International J. Comp. Inf. Science"},{"key":"14_CR4","doi-asserted-by":"crossref","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. of Algorithms 8 (1987), pp. 159\u2013172","journal-title":"J. of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner: Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1987","key":"14_CR5","DOI":"10.1007\/978-3-642-61568-9"},{"unstructured":"P.J. Kelly, E.G. Straus: Elements of Analytic Geometry, Scott, Foresman and Co., 1968","key":"14_CR6"},{"doi-asserted-by":"crossref","unstructured":"R.S. Millman, G.D. Parker: Geometry, A Metric Approach with Models, Springer-Verlag, 1981","key":"14_CR7","DOI":"10.1007\/978-1-4684-0130-1"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo: Linear Time Algorithm for Linear Programming in R 3 and Related Problems, SIAM J. of Computing 12 (1983), pp. 759\u2013776","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:41:09Z","timestamp":1640918469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}