{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:06:11Z","timestamp":1743138371702,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_8","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"42-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Translating a Planar Object to Maximize Point Containment"],"prefix":"10.1007","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Torben","family":"Hagerup","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Ray","sequence":"additional","affiliation":[]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"8_CR1","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, 9:495\u2013514, 1993.","journal-title":"Algorithmica"},{"key":"8_CR2","unstructured":"N.M. Amato, M.T. Goodrich, and E. A. Ramos. Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 705\u2013706, 2000."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0925-7721(96)00011-9","volume":"8","author":"G. Barequet","year":"1997","unstructured":"G. Barequet, M. Dickerson, and P. Pau. Translating a convex polygon to contain a maximum number of points. Comput. Geom. Theory Appl., 8:167\u2013179, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 50\u201361, 1991.","DOI":"10.1145\/113379.113384"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/S0097539796260321","volume":"28","author":"H. Br\u00f6nnimann","year":"1999","unstructured":"H. Br\u00f6nnimann, B. Chazelle, and J. Matou?sek. Product range spaces, sensitive sampling, and derandomization. SIAM J. Comput., 28:1552\u20131575, 1999. 51","journal-title":"SIAM J. Comput."},{"key":"8_CR6","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:145\u2013158, 1993.","journal-title":"Discrete Comput. Geom."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle and D.T. Lee. On a circle placement problem. Computing, 36:1\u201316, 1986.","journal-title":"Computing"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1006\/jagm.1995.1048","volume":"19","author":"A. Datta","year":"1995","unstructured":"A. Datta, H.-P. Lenhof, C. Schwarz, and M. Smid. Static and dynamic algorithms for k-point clustering problems. J. Algorithms, 19:474\u2013503, 1995.","journal-title":"J. Algorithms"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M. Dietzfelbinger","year":"1997","unstructured":"M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. J. Algorithms, 25:19\u201351, 1997.","journal-title":"J. Algorithms"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0925-7721(94)90003-5","volume":"4","author":"A. Efrat","year":"1994","unstructured":"A. Efrat, M. Sharir, and A. Ziv. Computing the smallest k-enclosing circle and related problems. Comput. Geom. Theory Appl., 4:119\u2013136, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Discrete Comput. Geom., 11:321\u2013350, 1994.","journal-title":"Discrete Comput. Geom."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A. Gajentaan","year":"1995","unstructured":"A. Gajentaan and M.H. Overmars. On a class of O(n 2) problems in computational geometry. Comput. Geom. Theory Appl., 5:165\u2013185, 1995.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"T._Hagerup and C. R\u00fcb. A guided tour of Cherno. bounds. Inform. Process. Lett., 33:305\u2013308, 1990.","DOI":"10.1016\/0020-0190(90)90214-I"},{"key":"8_CR14","unstructured":"D.P. Huttenlocher and S. Ullman. Object recognition using alignment. In Proc. 1st Internat. Conf. Comput. Vision, pages 102\u2013111, 1987."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59\u201371, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Y. Lamdan, J.T. Schwartz, and H. J. Wolfson. Object recognition by affine invariant matching. In Proc. IEEE Internat. Conf. Comput. Vision Pattern. Recogn., pages 335\u2013344, 1988.","DOI":"10.1109\/CVPR.1988.196257"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1142\/S0218195995000167","volume":"5","author":"H.P. Lenhof","year":"1995","unstructured":"H.P. Lenhof and M. Smid. Sequential and parallel algorithms for the k closest pairs problem. Internat. J. Comput. Geom. Appl., 5:273\u2013288, 1995.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"F.P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0925-7721(96)00019-3","volume":"10","author":"O. Schwarzkopf","year":"1998","unstructured":"O. Schwarzkopf, U. Fuchs, G. Rote, and E. Welzl. Approximation of convex figures by pairs of rectangles. Comput. Geom. Theory Appl., 10:77\u201387, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/BF02574706","volume":"6","author":"M. Sharir","year":"1991","unstructured":"M. Sharir. On k-sets in arrangements of curves and surfaces. Discrete Comput. Geom., 6:593\u2013613, 1991.","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:47:42Z","timestamp":1737175662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45749-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"29 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}