{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:05:57Z","timestamp":1751367957430},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1016\/0020-0190(92)90129-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"35-38","source":"Crossref","is-referenced-by-count":16,"title":["Computing the minimum weight triangulation of a set of linearly ordered points"],"prefix":"10.1016","volume":"42","author":[{"given":"Henk","family":"Meijer","sequence":"first","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90129-J_BIB1","series-title":"M.Sc. Thesis","article-title":"Progress in minimum weight triangulation","author":"Anagnostou","year":"1990"},{"key":"10.1016\/0020-0190(92)90129-J_BIB2","series-title":"Computer and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90129-J_BIB3","series-title":"M.Sc. Thesis","article-title":"New results in planar triangulations","author":"Gilbert","year":"1979"},{"key":"10.1016\/0020-0190(92)90129-J_BIB4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(80)90062-9","article-title":"A note on Delaunay and optimal triangulations","volume":"10","author":"Kirkpatrick","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90129-J_BIB5","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\/0020-0190(92)90129-J_BIB6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90170-0","article-title":"An \u03a9(n) lower bound for the nonoptimality of the greedy triangulation","volume":"25","author":"Levcopoulos","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90129-J_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(86)90038-4","article-title":"The greedy and Delaunay triangulations are not bad in the average case","volume":"22","author":"Lingas","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90129-J_BIB8","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290129J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290129J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:04Z","timestamp":1555144024000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290129J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002001909290129J"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90129-j","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}