{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T20:16:52Z","timestamp":1773778612118,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540388753","type":"print"},{"value":"9783540388760","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_73","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"829-840","source":"Crossref","is-referenced-by-count":28,"title":["Exact and Efficient Construction of Planar Minkowski\u00a0Sums\u00a0Using\u00a0the\u00a0Convolution\u00a0Method"],"prefix":"10.1007","author":[{"given":"Ron","family":"Wein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"73_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0925-7721(01)00041-4","volume":"21","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Flato, E., Halperin, D.: Polygon decomposition for efficient construction of Minkowski sums. Computational Geometry: Theory and Applications\u00a021, 39\u201361 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"73_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/B978-0-444-87806-9.50009-8","volume-title":"Computational Geometry","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B., Dobkin, D.P.: Optimal convex decompositions. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 63\u2013133. North-Holland, Amsterdam (1985)"},{"key":"73_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"73_CR4","unstructured":"Flato, E.: Robust and efficient construction of planar Minkowski sums. Master\u2019s thesis, School of Computer Science, Tel-Aviv University (2000), http:\/\/www.cs.tau.ac.il\/CGAL\/Theses\/flato\/thesis\/"},{"key":"73_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/978-3-540-30140-0_59","volume-title":"Algorithms \u2013 ESA 2004","author":"E. Fogel","year":"2004","unstructured":"Fogel, E., Wein, R., Halperin, D.: Code flexibility and program efficiency by genericity: Improving Cgal\u2019s arrangements. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 664\u2013676. Springer, Heidelberg (2004)"},{"key":"73_CR6","series-title":"Adv. Comput. Res.","first-page":"235","volume-title":"Computational Geometry","author":"D.H. Greene","year":"1983","unstructured":"Greene, D.H.: The decomposition of polygons into convex parts. In: Preparata, F.P. (ed.) Computational Geometry. Adv. Comput. Res., vol.\u00a01, pp. 235\u2013259. JAI Press, Greenwich (1983)"},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Ramshaw, L., Stolfi, J.: A kinetic framework for computational geometry. In: Proc. 24th Sympos. Found. Comput. Sci., pp. 100\u2013111 (1983)","DOI":"10.1109\/SFCS.1983.1"},{"key":"73_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02187878","volume":"2","author":"L.J. Guibas","year":"1987","unstructured":"Guibas, L.J., Seidel, R.: Computing convolutions by reciprocal search. Discrete and Computational Geometry\u00a02, 175\u2013193 (1987)","journal-title":"Discrete and Computational Geometry"},{"key":"73_CR9","unstructured":"Har-Peled, S., Chan, T.M., Aronov, B., Halperin, D., Snoeyink, J.: The complexity of a single face of a Minkowski sum. In: Proc. 7th Canad. Conf. Comput. Geom., pp. 91\u201396 (1995)"},{"key":"73_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-12689-9_105","volume-title":"Foundations of Computation Theory","author":"S. Hertel","year":"1983","unstructured":"Hertel, S., Mehlhorn, K.: Fast triangulation of simple polygons. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 207\u2013218. Springer, Heidelberg (1983)"},{"key":"73_CR11","unstructured":"Kaul, A., O\u2019Connor, M.A., Srinivasan, V.: Computing Minkowski sums of regular polygons. In: Proc. 3rd Canad. Conf. Comput. Geom., pp. 74\u201377 (1991)"},{"key":"73_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete and Computational Geometry\u00a01, 59\u201371 (1986)","journal-title":"Discrete and Computational Geometry"},{"key":"73_CR13","volume-title":"Leda: A Platform for Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., N\u00e4her, S.: Leda: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (2000)"},{"key":"73_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534471.001.0001","volume-title":"Visual Complex Analysis","author":"T. Needham","year":"1997","unstructured":"Needham, T.: Visual Complex Analysis. Oxford University Press, Oxford (1997)"},{"key":"73_CR15","doi-asserted-by":"crossref","unstructured":"Ramkumar, G.D.: An algorithm to compute the Minkowski sum outer-face of two simple polygons. In: Proc. 12th Sympos. Comput. Geom., pp. 234\u2013241 (1996)","DOI":"10.1145\/237218.237374"},{"key":"73_CR16","unstructured":"Wein, R., Fogel, E., Zukerman, B., Halperin, D.: Advanced programming techniques applied to Cgal\u2019s arrangement package. In: Proc. Wrkshp. Library-Centric Software Design (2005), http:\/\/lcsd05.cs.tamu.edu\/#program"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_73.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T11:26:04Z","timestamp":1707218764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11841036_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}