{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T19:10:23Z","timestamp":1770664223535,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,3,1]],"date-time":"2000-03-01T00:00:00Z","timestamp":951868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,3]]},"DOI":"10.1016\/s0377-2217(99)00033-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"330-342","source":"Crossref","is-referenced-by-count":30,"title":["Algorithms for the decomposition of a polygon into convex polygons"],"prefix":"10.1016","volume":"121","author":[{"given":"J","family":"Fern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"L","family":"C\u00e1novas","sequence":"additional","affiliation":[]},{"given":"B","family":"Pelegr\u0131\u0301n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00033-8_BIB1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete and Computational Geometry"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB2","doi-asserted-by":"crossref","unstructured":"B. Chazelle, D.P. Dobkin, Optimal convex decompositions. in: Computational Geometry, Elsevier Science Publishers, North-Holland, 1985, pp. 63\u2013133","DOI":"10.1016\/B978-0-444-87806-9.50009-8"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB3","unstructured":"E.V. Denardo, Dynamic Programming: Models and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1982"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB4","unstructured":"Z. Drezner (Ed.), Facility Location. A Survey of Applications and Methods, Springer Series in Operations Research, Springer, New York, 1995"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB5","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/0022-247X(70)90066-1","article-title":"The concept of State in discrete dynamic programming","volume":"29","author":"Elmaghraby","year":"1970","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB6","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/T-C.1975.224276","article-title":"Decomposition of polygons into simpler components: Feature generation for syntactic pattern recognition","volume":"24","author":"Feng","year":"1975","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB7","unstructured":"J. Fern\u00e1ndez, L. C\u00e1novas, B. Pelegr\u0131\u0301n, Two hundred and fifty nonconvex polygons, Internal Report, 1997"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB8","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/S0377-2217(97)00225-7","article-title":"DECOPOL \u2013 Codes for decomposing a polygon into convex subpolygons","volume":"102","author":"Fern\u00e1ndez","year":"1997","journal-title":"European Journal of Operational Research (O.R.S.E.P. section)"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB9","unstructured":"J. Fern\u00e1ndez, L. C\u00e1novas, B. Pelegr\u0131\u0301n, Un algoritmo para la descomposici\u00f3n de pol\u0131\u0301gonos en pol\u0131\u0301gonos convexos, XXIII Congreso Nacional de Estad\u0131\u0301stica e Investigaci\u00f3n Operativa, Valencia (1997) 34.9-34.10"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB10","unstructured":"R.L. Francis, L.F. McGinnis, J.A. White, Facility Layout and Location: An Analytical Approach, 2nd ed., International Series in Industrial and Systems Engineering, Prentice-Hall, Englewood Cliffs, NJ, 1992"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB11","doi-asserted-by":"crossref","unstructured":"S. Hertel, K. Mehlhorn, Fast triangulation of simple polygons, in: Proc. 4th Internat. Conf. Found. Comput. Theory, in Lecture Notes in Computer Science, vol. 158, Springer, New York, 1983, pp. 207\u2013218","DOI":"10.1007\/3-540-12689-9_105"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB12","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 Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB13","doi-asserted-by":"crossref","unstructured":"A. Lingas, The power of non-rectilinear holes, in: Automata, Languages and Programming (Aarhus, 1982), Springer, Berlin, 1982, pp. 369\u2013383","DOI":"10.1007\/BFb0012784"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1978-2116","article-title":"On two-dimensional data organization II","volume":"2","author":"Lipski","year":"1979","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB15","unstructured":"R.F. Love, J.G. Morris, G.O. Wesolowsky, Facilities Location: Models and Methods, North-Holland, New York, 1988"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB16","unstructured":"W. Newman, K.J. Sproull, Principles of Interactive Computer Graphics, 2nd ed., McGraw-Hill, New York, 1979"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB17","unstructured":"J. O'Rourke, Art Gallery Theorems and Algorithms, International Series of Monographs on Computes Science, Oxford University Press, New York, 1987"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB18","unstructured":"J. O'Rourke, Computational Geometry in C, Cambridge University Press, Cambridge, 1994"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB19","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1142\/S0218195996000319","article-title":"Computational geometry column 29","volume":"6","author":"O'Rourke","year":"1996","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB20","doi-asserted-by":"crossref","unstructured":"F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985 (Corrected and expanded second printing, 1988)","DOI":"10.1007\/978-1-4612-1098-6_1"},{"key":"10.1016\/S0377-2217(99)00033-8_BIB21","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1109\/TC.1978.1675001","article-title":"Decomposition of polygons into convex sets","volume":"27","author":"Schachter","year":"1978","journal-title":"IEEE Transactions on Computers"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000338?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799000338?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T09:30:15Z","timestamp":1681205415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799000338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["S0377221799000338"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00033-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}