{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:31Z","timestamp":1725571291580},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_9","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"97-108","source":"Crossref","is-referenced-by-count":3,"title":["Maximum Overlap of Convex Polytopes under Translation"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siu-Wing","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iris","family":"Reinbacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.comgeo.2007.08.001","volume":"40","author":"H.-K. Ahn","year":"2008","unstructured":"Ahn, H.-K., Brass, P., Shin, C.-S.: Maximum overlap and minimum convex hull of two convex polyhedra under translation. Comput. Geom. Theory and Appl.\u00a040, 171\u2013177 (2008)","journal-title":"Comput. Geom. Theory and Appl."},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2006.01.005","volume":"37","author":"H.-K. Ahn","year":"2007","unstructured":"Ahn, H.-K., Cheong, O., Park, C.-D., Shin, C.-S., Vigneron, A.: Maximizing the Overlap of Two Planar Convex Sets under Rigid Motions. Comput. Geom. Theory and Appl.\u00a037, 3\u201315 (2007)","journal-title":"Comput. Geom. Theory and Appl."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/PL00005845","volume":"31","author":"M. Berg de","year":"1998","unstructured":"de Berg, M., Cheong, O., Devillers, O., van Kreveld, M., Teillaud, M.: Computing the Maximum Overlap of Two Convex Polygons under Translations. Theory of Comput. Syst.\u00a031, 613\u2013628 (1998)","journal-title":"Theory of Comput. Syst."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/0221041","volume":"21","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B.: An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Computing\u00a021, 671\u2013696 (1992)","journal-title":"SIAM J. Computing"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF02573985","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: An optimal convex hull algorithm in any fixed dimension. Discr. Comput. Geom.\u00a09, 377\u2013409 (1993)","journal-title":"Discr. Comput. Geom."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: Cutting Hyperplanes for Divide-and-Conquer. Discr. Comput. Geom.\u00a09, 145\u2013159 (1993)","journal-title":"Discr. Comput. Geom."},{"doi-asserted-by":"crossref","unstructured":"Dobkin, D.P., Kirkpatrick, D.G.: Determining the separation of preprocessed polyhedra \u2013 a unified approach. In: Proc. 17th Internat. Colloq. Automata Lang. Program., pp. 400\u2013413 (1990)","key":"9_CR7","DOI":"10.1007\/BFb0032047"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Heidelberg (1987)"},{"key":"9_CR9","first-page":"37","volume":"3","author":"K. Fukuda","year":"2007","unstructured":"Fukuda, K., Uno, T.: Polynomial time algorithms for maximizing the intersection volume of polytopes. Pacific J. Optimization\u00a03, 37\u201352 (2007)","journal-title":"Pacific J. Optimization"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discr. Comput. Geom.\u00a02, 127\u2013151 (1987)","journal-title":"Discr. Comput. Geom."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1109\/34.713363","volume":"20","author":"H.J.A.M. Heijmans","year":"1998","unstructured":"Heijmans, H.J.A.M., Tuzikov, A.V.: Similarity and symmetry measures for convex shapes using Minkowski addition. IEEE Trans. PAMI\u00a020, 980\u2013993 (1998)","journal-title":"IEEE Trans. PAMI"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM\u00a031, 114\u2013127 (1984)","journal-title":"J. ACM"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-55426-2_53","volume-title":"Computer Vision - ECCV \u201992","author":"F. Meyer","year":"1992","unstructured":"Meyer, F., Bouthemy, P.: Region-based tracking in an image sequence. In: Sandini, G. (ed.) ECCV 1992. LNCS, vol.\u00a0588, pp. 476\u2013484. Springer, Heidelberg (1992)"},{"key":"9_CR14","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"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/B978-0-444-89596-7.50007-9","volume-title":"Handbook on Convex Geometry","author":"J.R. Sangwine-Yager","year":"1993","unstructured":"Sangwine-Yager, J.R.: Mixed Volumes. In: Gruber, P.M., Wills, J.M. (eds.) Handbook on Convex Geometry, vol.\u00a0A, pp. 43\u201371. Elsevier, Amsterdam (1993)"},{"doi-asserted-by":"crossref","unstructured":"Vigneron, A.: Geometric optimization and sums of algebraic functions. In: Proc. ACM\u2013SIAM Sympos. Alg., pp. 906\u2013917 (2010)","key":"9_CR16","DOI":"10.1137\/1.9781611973075.73"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T19:49:11Z","timestamp":1559850551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}