{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:15:54Z","timestamp":1787494554726,"version":"build-2736575974"},"reference-count":28,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0925-7721(93)90016-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:41:31Z","timestamp":1027640491000},"page":"247-259","source":"Crossref","is-referenced-by-count":21,"title":["Polynomial-time instances of the minimum weight triangulation problem"],"prefix":"10.1016","volume":"3","author":[{"given":"Efthymios","family":"Anagnostou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Derek","family":"Corneil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90016-Y_BIB1","article-title":"Progress in minimum weight triangulation","author":"Anagnostou","year":"1990"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB2","doi-asserted-by":"crossref","unstructured":"M. Bern and D. Eppstein, Mesh generation and optimal triangulation, in: D.-Z. Du and F.K. Hwang, eds., Computing in Euclidean Geometry; 23\u201390.","DOI":"10.1142\/9789814355858_0002"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB3","article-title":"Problems polynomially equivalent to graph isomorphism","author":"Booth","year":"1979"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB4","article-title":"Optimal algorithms for computing depths and layers","author":"Chazelle","year":"1983"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB5","first-page":"17","article-title":"Approximating algorithms for planar traveling salesman tours and minimum-length triangulation","author":"Clarkson","year":"1991","journal-title":"SODA"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB6_1","first-page":"77","article-title":"Automatische Interpolation von Isolinen bei willkurlichen Stutzpunkten","author":"Duppe","year":"1970","journal-title":"Allgemeine Vermessugnsberichten"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB6_2","first-page":"423","article-title":"Automatische Interpolation von Isolinen bei willkurlichen Stutzpunkten","author":"Duppe","year":"1970","journal-title":"Allgemeine Vermessungsberichten"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB7","first-page":"414","article-title":"A quadratic time algorithm for the minmax length triangulation","author":"Edelsbrunner","year":"1991","journal-title":"FOCS"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB8","first-page":"44","article-title":"An O(n2log n) time algorithm for the minmax angle triangulation","author":"Edelsbrunner","year":"1990","journal-title":"Proc. 6th Ann. Symp. Comp. Geom."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB9","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/0022-247X(70)90066-1","article-title":"The concept of \u201cState\u201d in discrete dynamic programming","volume":"29","author":"Elmaghraby","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0925-7721(92)90013-I","article-title":"The farthest point Delaunay triangulation minimizes angles","volume":"1","author":"Eppstein","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB11","first-page":"48","article-title":"Approximating the minimum weight triangulation","author":"Eppstein","year":"1992","journal-title":"SODA"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB12","author":"Garey","year":"1979"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB13","article-title":"New results in planar triangulations","author":"Gilbert","year":"1979"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB14","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1002\/nme.1620290603","article-title":"Hypersingular integrals in boundary element fracture analysis","volume":"29","author":"Gray","year":"1990","journal-title":"Internat. J. Numer. Methods Engrg."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB15","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/0196-6774(88)90033-8","article-title":"The NP-completeness column: an ongoing guide","volume":"9","author":"Johnson","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane","volume":"2","author":"Karp","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB17","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\/0925-7721(93)90016-Y_BIB18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(80)90062-9","article-title":"A note on Delauney and optimal triangulations","volume":"10","author":"Kirkpatrick","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","article-title":"Minimal triangulations of polygonal domains","volume":"9","author":"Klincsek","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90170-0","article-title":"An \u03a9(\u221an) lower bound for the nonoptimality of the greedy triangulation","volume":"25","author":"Levcopoulos","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB21","article-title":"Advances in minimum weight triangulation","author":"Lingas","year":"1983"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(86)90038-4","article-title":"The greedy and Delauney triangulations are not bad in the average case","volume":"22","author":"Lingas","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB23","first-page":"228","article-title":"On triangulations of a set of points in the plane","author":"Lloyd","year":"1977","journal-title":"Proc. 18th Ann. IEEE Sympos. Found. Comput. Sci."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(79)90104-2","article-title":"Neither the greedy nor the Delauney triangulation of a planar point set approximates the optimal triangulation","volume":"9","author":"Manacher","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(93)90016-Y_BIB25","article-title":"Computing the minimum weight triangulations of a set of linerly ordered points","author":"Meijer","year":"1991"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB26","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/0196-6774(87)90020-4","article-title":"A heuristic triangulation algorithm","volume":"8","author":"Plaisted","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90016-Y_BIB27","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975","journal-title":"Proc. 16th Ann. IEEE Sympos. Found. Comput. Sci."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390016Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390016Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T05:56:34Z","timestamp":1580882194000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390016Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["092577219390016Y"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90016-y","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}