{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:37:37Z","timestamp":1778852257638,"version":"3.51.4"},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0925-7721(01)00041-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T14:29:16Z","timestamp":1034605756000},"page":"39-61","source":"Crossref","is-referenced-by-count":90,"title":["Polygon decomposition for efficient construction of Minkowski sums"],"prefix":"10.1016","volume":"21","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Flato","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(01)00041-4_BIB001","series-title":"Handbook of Computational Geometry","first-page":"49","article-title":"Arrangements","author":"Agarwal","year":"1999"},{"issue":"4","key":"10.1016\/S0925-7721(01)00041-4_BIB002","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/PL00009436","article-title":"Approximating minimum-weight triangulations in three dimensions","volume":"21","author":"Aronov","year":"1999","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB003","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01553884","article-title":"Generation of configuration space obstacles: the case of moving algebraic curves","volume":"4","author":"Bajaj","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB004","series-title":"Handbook of Discrete and Computational Geometry","first-page":"413","article-title":"Triangulations","author":"Bern","year":"1997"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB005","series-title":"Computational Geometry","first-page":"63","article-title":"Optimal convex decompositions","author":"Chazelle","year":"1985"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB006","series-title":"Proc. 6th Canad. Conf. Comput. Geom.","first-page":"225","article-title":"Limited gaps","author":"Daniels","year":"1994"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB007","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB008","doi-asserted-by":"crossref","unstructured":"G. Elber, M.-S. Kim, Offsets, Sweeps and Minkowski Sums, Special Issue of Comput. Aided Design 31 (1999)","DOI":"10.1016\/S0010-4485(99)00012-3"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB009","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02574002","article-title":"Approximating the minimum weight Steiner triangulation","volume":"11","author":"Eppstein","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB010","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1002\/1097-024X(200009)30:11<1167::AID-SPE337>3.0.CO;2-B","article-title":"On the design of CGAL, the Computational Geometry Algorithms Library","volume":"30","author":"Fabri","year":"2000","journal-title":"Software \u2013 Practice Exper."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB011","author":"Flato"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB012","series-title":"Abstracts 16th European Workshop Comput. Geom.","first-page":"85","article-title":"Robust and efficient construction of planar Minkowski sums","author":"Flato","year":"2000"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB013","series-title":"Proceedings of the 3rd Workshop on Algorithm Engineering","first-page":"154","article-title":"The design and implementation of planar maps in CGAL","volume":"1148","author":"Flato","year":"1999"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB014","series-title":"Handbook of Discrete and Computational Geometry","first-page":"389","article-title":"Arrangements","author":"Halperin","year":"1997"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB015","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s004539910025","article-title":"A general framework for assembly planning: The motion space approach","volume":"26","author":"Halperin","year":"2000","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB016","unstructured":"I. Hanniel, The design and implementation of planar arrangements of curves in CGAL, Master's thesis, Department of Computer Science, Tel-Aviv University, 2000"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB017","series-title":"Proc. 3rd Scand. Workshop Algorithm Theory","first-page":"258","article-title":"Triangulating planar graphs while minimizing the maximum degree","volume":"621","author":"Kant","year":"1992"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB018","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1142\/S0218195995000258","article-title":"Computing Minkowski sums of plane curves","volume":"5","author":"Kaul","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB019","series-title":"Proc. 3rd Canad. Conf. Comput. Geom.","first-page":"74","article-title":"Computing Minkowski sums of regular polygons","author":"Kaul","year":"1991"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB020","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","article-title":"On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles","volume":"1","author":"Kedem","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB021","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1137\/0214056","article-title":"Decomposing a polygon into simpler components","volume":"14","author":"Keil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB022","series-title":"Computational Geometry","first-page":"197","article-title":"Minimum decompositions of polygonal objects","author":"Keil","year":"1985"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB023","series-title":"Proc. 10th Canad. Conf. Comput. Geom.","article-title":"On the time bound for convex decomposition of simple polygons","author":"Keil","year":"1998"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB024","series-title":"Handbook of Computational Geometry","article-title":"Polygon decomposition","author":"Keil","year":"1999"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB025","series-title":"Robot Motion Planning","author":"Latombe","year":"1991"},{"issue":"2","key":"10.1016\/S0925-7721(01)00041-4_BIB026","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1006\/gmip.1998.0464","article-title":"Polynomial\/rational approximation of Minkowski sum boundary curves","volume":"60","author":"Lee","year":"1998","journal-title":"Graphical Models Image Process."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB027","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02187867","article-title":"Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams","volume":"2","author":"Leven","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(01)00041-4_BIB028","series-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"Melhorn","year":"1999"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB029","author":"Mehlhorn"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB030","series-title":"Proc. 4th Canad. Conf. Comput. Geom.","first-page":"236","article-title":"Placement and compaction of nonconvex polygons for clothing manufacture","author":"Milenkovic","year":"1992"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB031","series-title":"Computational Geometry: An Introduction through Randomized Algorithms","author":"Mulmuley","year":"1994"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB032","series-title":"Integral Probability and Geometric Probability","volume":"1","author":"Santal\u00f3","year":"1979"},{"key":"10.1016\/S0925-7721(01)00041-4_BIB033","series-title":"Davenport\u2013Schinzel Sequences and Their Geometric Applications","author":"Sharir","year":"1995"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000414?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772101000414?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:15:18Z","timestamp":1578442518000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772101000414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0925772101000414"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(01)00041-4","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}