{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:24:54Z","timestamp":1649013894159},"reference-count":21,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1016\/0020-0190(96)00012-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:22:55Z","timestamp":1027624975000},"page":"253-260","source":"Crossref","is-referenced-by-count":11,"title":["Drawing outerplanar minimum weight triangulations"],"prefix":"10.1016","volume":"57","author":[{"given":"William","family":"Lenhart","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00012-9_BIB1","series-title":"Proceedings 11th ACM Symposium on Computational Geometry","first-page":"220","article-title":"Triangulations intersect nicely","author":"Aichholzer","year":"1995"},{"key":"10.1016\/0020-0190(96)00012-9_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0020-0190(96)00012-9_BIB3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for automatic graph drawing: An annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0020-0190(96)00012-9_BIB4","series-title":"Proceedings 11th ACM Symposium on Computational Geometry","first-page":"238","article-title":"New algorithms and empirical findings on minimum weight triangulations heuristics","author":"Dickerson","year":"1995"},{"key":"10.1016\/0020-0190(96)00012-9_BIB5","series-title":"Proceedings 10th ACM Symposium on Computational Geometry","first-page":"49","article-title":"The realization pRoblem for Euclidean minimum spanning tree is NP-hard","author":"Eades","year":"1994"},{"key":"10.1016\/0020-0190(96)00012-9_BIB6","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(96)00012-9_BIB7","article-title":"New results in planar triangulations","author":"Gilbert","year":"1979"},{"key":"10.1016\/0020-0190(96)00012-9_BIB8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/BF01188718","article-title":"New results for the minimum weight triangulation problem","volume":"12","author":"Heath","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(96)00012-9_BIB9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0925-7721(94)90014-0","article-title":"Computing a subgraph of the minimum weight triangulation","volume":"4","author":"Keil","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/0020-0190(96)00012-9_BIB10","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(96)00012-9_BIB11","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(96)00012-9_BIB12","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\/0020-0190(96)00012-9_BIB13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01840358","article-title":"On approximation behavior of the greedy triangulation for convex polygons","volume":"2","author":"Levcopoulos","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(96)00012-9_BIB14","series-title":"Proceedings 23rd Allerton Conference on Computing, Communication, and Control","first-page":"480","article-title":"A linear-time heuristic for minimum weight triangulation of convex polygons","author":"Lingas","year":"1985"},{"key":"10.1016\/0020-0190(96)00012-9_BIB15","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(96)00012-9_BIB16","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/0608053","article-title":"A new heuristic for minimum weight triangulation","volume":"8","author":"Lingas","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0020-0190(96)00012-9_BIB17","series-title":"Proceedings 18th Conference on the Foundations of Computer Science","first-page":"228","article-title":"On triangulations of a set of points in the plane","author":"Lloyd","year":"1977"},{"key":"10.1016\/0020-0190(96)00012-9_BIB18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(79)90104-2","article-title":"Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation","volume":"9","author":"Manacher","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00012-9_BIB19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(92)90129-J","article-title":"Computing the minimum weight triangulation of a set of linearly ordered points","volume":"42","author":"Meijer","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00012-9_BIB20","series-title":"Proceedings 7th ACM Symposium on Computational Geometry","first-page":"239","article-title":"Transitions in geometric minimum spanning trees","author":"Monma","year":"1991"},{"key":"10.1016\/0020-0190(96)00012-9_BIB21","series-title":"Computational Geometry \u2014 An Introduction","author":"Preparata","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000129?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000129?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:52:25Z","timestamp":1555959145000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0020019096000129"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00012-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}