{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:05Z","timestamp":1725455525650},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009488","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:32:17Z","timestamp":1129818737000},"page":"126-135","source":"Crossref","is-referenced-by-count":6,"title":["Computing the maximum overlap of two convex polygons under translations"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Devillers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Schwarzkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Teillaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"key":"13_CR1","unstructured":"Pankaj K. Agarwal, Micha Sharir, and Sivan Toledo. Applications of parametric searching in geometric optimization. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 72\u201382, 1992."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"H. Alt, B. Behrends, and J. Bl\u00f6mer. Approximate matching of polygonal shapes. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 186\u2013193, 1991.","DOI":"10.1145\/109648.109669"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"H. Alt and M. Godau. Measuring the resemblance of polygonal curves. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 102\u2013109, 1992.","DOI":"10.1145\/142675.142699"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"D. Avis, P. Bose, T. Shermer, J. Snoeyink, G. Toussaint, and B. Zhu. On the sectional area of convex polytopes. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages C11\u2013C12, 1996.","DOI":"10.1145\/237218.237411"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"F. Avnaim and J.-D. Boissonnat. Polygon placement under translation and rotation. In Proc. 5th Sympos. Theoret. Aspects Comput. Sci., volume 294 of Lecture Notes in Computer Science, pages 322\u2013333. Springer-Verlag, 1988.","DOI":"10.1007\/BFb0035856"},{"key":"13_CR6","series-title":"volume 1 of Advances in Computing Research","first-page":"1","volume-title":"Computational Geometry","author":"B. Chazelle","year":"1983","unstructured":"B. Chazelle. The polygon containment problem. In F. P. Preparata, editor, Computational Geometry, volume 1 of Advances in Computing Research, pages 1\u201333. JAI Press, London, England, 1983."},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/0221041","volume":"21","author":"B. Chazelle","year":"1992","unstructured":"B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Comput., 21(4):671\u2013696, 1992.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145\u2013158, 1993.","journal-title":"Discrete Comput. Geom."},{"key":"13_CR9","unstructured":"L. P. Chew, M. T. Goodrich, D. P. Huttenlocher, K. Kedem, J. M. Kleinberg, and D. Kravets. Geometric pattern matching under Euclidean motion. In Proc. 5th Canad. Conf. Comput. Geom., pages 151\u2013156, Waterloo, Canada, 1993."},{"issue":"2","key":"13_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0925-7721(93)90001-M","volume":"3","author":"L. P. Chew","year":"1993","unstructured":"L. P. Chew and K. Kedem. Placing the largest similar copy of a convex polygon among polygonal obstacles. Comput. Geom. Theory Appl., 3(2):59\u201389, 1993.","journal-title":"Comput. Geom. Theory Appl."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"S. J. Fortune. A fast algorithm for polygon containment by translation. In Proc. 12th Internat. Colloq. Automata Lang. Program., volume 194 of Lecture Notes in Computer Science, pages 189\u2013198. Springer-Verlag, 1985.","DOI":"10.1007\/BFb0015744"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G. Frederickson","year":"1984","unstructured":"G. Frederickson and D. Johnson. Generalized selection and ranking: sorted matrices. SIAM J. Comput., 13:14\u201330, 1984.","journal-title":"SIAM J. Comput."},{"key":"13_CR13","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum. Convex Polytopes. Wiley, New York, NY, 1967."},{"key":"13_CR14","volume-title":"Ph.D. thesis","author":"D. Halperin","year":"1992","unstructured":"D. Halperin. Algorithmic Motion Planning via Arrangements of Curves and of Surfaces. Ph.D. thesis, Computer Science Department, Tel-Aviv University, Tel Aviv, 1992."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"D. P. Huttenlocher, K. Kedem, and J. M. Kleinberg. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 110\u2013120, 1992.","DOI":"10.1145\/142675.142700"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02189323","volume":"9","author":"D. P. Huttenlocher","year":"1993","unstructured":"D. P. Huttenlocher, K. Kedem, and M. Sharir. The upper envelope of Voronoi surfaces and its applications. Discrete Comput. Geom., 9:267\u2013291, 1993.","journal-title":"Discrete Comput. Geom."},{"key":"13_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J.-C. Latombe","year":"1991","unstructured":"J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991."},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1117\/12.165000","volume":"2060","author":"D.M. Mount","year":"1993","unstructured":"D.M. Mount, R. Silverman, and A. Wu. On the area of overlap of translated polygons. SPIE Vision Geometry II, 2060:254\u2013264, 1993.","journal-title":"SPIE Vision Geometry II"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"M. Sharir, R. Cole, K. Kedem, D. Leven, R. Pollack, and S. Sifrony. Geometric applications of Davenport-Schinzel sequences. In Proc. 27th Annu. IEEE Sympos. Found. Comput. Sci., pages 77\u201386, 1986.","DOI":"10.1109\/SFCS.1986.23"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0255(94)00053-E","volume":"82","author":"R. Venkatasubramanian","year":"1995","unstructured":"R. Venkatasubramanian. On the area of intersection of two closed 2D objects. Information Sciences, 82:25\u201344, 1995.","journal-title":"Information Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T11:13:26Z","timestamp":1586517206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0009488","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}