{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:42Z","timestamp":1725559002091},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_13","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T13:27:29Z","timestamp":1279027649000},"page":"138-149","source":"Crossref","is-referenced-by-count":5,"title":["Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion"],"prefix":"10.1007","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Cabello","sequence":"additional","affiliation":[]},{"given":"Panos","family":"Giannopoulos","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"van Oostrum","sequence":"additional","affiliation":[]},{"given":"Remco C.","family":"Veltkamp","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Har-Peled, S., Sharir, M., Wang, Y.: Hausdorff distance under translation for points, disks, and balls. In: Proceedings of the 19th Annual ACM Symposium on Computational Geometry, pp. 282\u2013291 (2003)","DOI":"10.1145\/777833.777835"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/PL00009388","volume":"20","author":"T. Akutsu","year":"1998","unstructured":"Akutsu, T., Tamaki, H., Tokuyama, T.: Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. Discrete and Computational Geometry\u00a020(3), 307\u2013331 (1998)","journal-title":"Discrete and Computational Geometry"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/PL00009210","volume":"21","author":"H. Alt","year":"1998","unstructured":"Alt, H., Fuchs, U., Rote, G., Weber, G.: Matching convex shapes with respect to the symmetric difference. Algorithmica\u00a021, 89\u2013103 (1998)","journal-title":"Algorithmica"},{"key":"13_CR4","first-page":"121","volume-title":"Handbook of Computational Geometry","author":"H. Alt","year":"1999","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 121\u2013153. Elsevier Science Publishers B.V. North-Holland, Amsterdam (1999)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Amenta, N., Kolluri, R.: Accurate and efficient unions of balls. In: Proceedings of the 16th Annual ACM Symposium on Computational Geometry, pp. 119\u2013128 (2000)","DOI":"10.1145\/336154.336193"},{"key":"13_CR6","unstructured":"Cheong, O., Efrat, A., Har-Peled, S.: On finding a guard that sees most and a shop that sells most. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 1098\u20131107 (2004)"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0925-7721(95)00047-X","volume":"7","author":"P. Chew","year":"1997","unstructured":"Chew, P., Goodrich, M., Huttenlocher, D.P., Kedem, K., Kleinberg, J.M., Kravets, D.: Geometric pattern matching under euclidean motion. Computational Geometry: Theory and Applications \u00a07,113\u2013124 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/PL00005845","volume":"31","author":"M. Berg de","year":"1998","unstructured":"de Berg, M., Devillers, O., van Kreveld, M., Schwarzkopf, O., Teillaud, M.: Computing the maximum overlap of two convex polygons under translations. Theory Comput. Systems\u00a031, 613\u2013628 (1998)","journal-title":"Theory Comput. Systems"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-003-1043-4","volume":"38","author":"M. Gavrilov","year":"2003","unstructured":"Gavrilov, M., Indyk, P., Motwani, R., Venkatasubramanian, S.: Combinatorial and experimental methods for approximate point pattern matching. Algorithmica\u00a038(2), 59\u201390 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"13_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-7721(98)00023-6","volume":"11","author":"D. Halperin","year":"1998","unstructured":"Halperin, D., Overmars, M.H.: Spheres, molecules, and hidden surface removal. Computational Geometry: Theory and Applications\u00a011(2), 83\u2013102 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/cviu.1996.0045","volume":"64","author":"D.M. Mount","year":"1996","unstructured":"Mount, D.M., Silverman, R., Wu, A.Y.: On the area of overlap of translated polygons. Computer Vision and Image Understanding\u00a064, 53\u201361 (1996)","journal-title":"Computer Vision and Image Understanding"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TPAMI.1979.4766925","volume":"1","author":"J. O\u2019Rourke","year":"1979","unstructured":"O\u2019Rourke, J., Badler, N.: Decomposition of three dimensional objects into spheres. IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI)\u00a01(3), 295\u2013305 (1979)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI)"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1111\/1467-8659.1530129","volume":"15","author":"V. Ranjan","year":"1996","unstructured":"Ranjan, V., Fournier, A.: Matching and interpolation of shapes using unions of circles. Computer Graphics Forum\u00a015(3), 129\u2013142 (1996)","journal-title":"Computer Graphics Forum"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:15:13Z","timestamp":1559250913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}