{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:05:24Z","timestamp":1648843524087},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"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":[[1994,5]]},"DOI":"10.1016\/0020-0190(94)00027-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"173-176","source":"Crossref","is-referenced-by-count":2,"title":["Simpler proof of a realizability theorem on Delaunay triangulations"],"prefix":"10.1016","volume":"50","author":[{"given":"Kokichi","family":"Sugihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00027-1_BIB1","first-page":"292","article-title":"Hamiltonian cycles in Delaunay complexes","volume":"391","author":"Crapo","year":"1988"},{"key":"10.1016\/0020-0190(94)00027-1_BIB2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02187810","article-title":"Toughness and Delaunay triangulations","volume":"5","author":"Dillencourt","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0020-0190(94)00027-1_BIB3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","article-title":"Realizability of Delaunay triangulations","volume":"33","author":"Dillencourt","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00027-1_BIB4","first-page":"198","article-title":"Maximal outerplaner graphs are relative neighborhood graphs","author":"Lubiw","year":"1993","journal-title":"Proc. 5th Canadian Conf. on Computational Geometry"},{"key":"10.1016\/0020-0190(94)00027-1_BIB5","series-title":"Spatial Tessellations \u2014 Concepts and Applications of Voronoi Diagrams","author":"Okabe","year":"1992"},{"key":"10.1016\/0020-0190(94)00027-1_BIB6","series-title":"Computational Geometry \u2014 An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(94)00027-1_BIB7","first-page":"468","article-title":"A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction","author":"Sugihara","year":"1992","journal-title":"IEICE Trans. Fundamentals Electron., Comm. and Comput. Sci."},{"key":"10.1016\/0020-0190(94)00027-1_BIB8","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1109\/5.163412","article-title":"Construction of the Voronoi diagram for \u201cone million\u201d generators in single-precision arithmetic","volume":"80","author":"Sugihara","year":"1992","journal-title":"Proc. IEEE"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094000271?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:50:40Z","timestamp":1555145440000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094000271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["0020019094000271"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00027-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}