{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:57:20Z","timestamp":1672430240439},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":7655,"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":[[1992,8]]},"DOI":"10.1016\/0925-7721(92)90018-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:31Z","timestamp":1027654891000},"page":"15-30","source":"Crossref","is-referenced-by-count":14,"title":["Hamiltonian triangulations and circumscribing polygons of disjoint line segments"],"prefix":"10.1016","volume":"2","author":[{"given":"Andranik","family":"Mirzaian","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(92)90018-N_BIB1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","article-title":"A linear-time algorithm for computing the Voronoi diagram of a convex polygon","volume":"4","author":"Aggarwal","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(92)90018-N_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90109-4","article-title":"A linear time algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs","volume":"7","author":"Asano","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0925-7721(92)90018-N_BIB3","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 Comput. Geom."},{"key":"10.1016\/0925-7721(92)90018-N_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(89)90012-6","article-title":"The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs","volume":"10","author":"Chiba","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(92)90018-N_BIB5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1145\/41958.41978","article-title":"Toughness and Delaunay triangulations","author":"Dillencourt","year":"1987","journal-title":"Proc. 3rd Annual Symposium on Computational Geometry"},{"key":"10.1016\/0925-7721(92)90018-N_BIB6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0020-0190(87)90160-8","article-title":"Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations","volume":"24","author":"Dillencourt","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(92)90018-N_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.3190140105","article-title":"Hamiltonian cycles in planar triangulations with no separating triangles","volume":"14","author":"Dillencourt","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0925-7721(92)90018-N_BIB8","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(92)90018-N_BIB9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(88)90089-0","article-title":"A Linear-time algorithm for finding a minimum spanning pseudoforest","volume":"27","author":"Gabow","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(92)90018-N_BIB10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(92)90018-N_BIB11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(83)90004-2","article-title":"Traveling salesman cycles are not always subgraphs of Voronoi Duals","volume":"16","author":"Kantabutra","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(92)90018-N_BIB12","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/SFCS.1989.63456","article-title":"Fast matching for points on a polygon","author":"Marcotte","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0925-7721(92)90018-N_BIB13","first-page":"319","article-title":"Circumscribing polygon of disjoint line segment","author":"Mirzaian","year":"1990","journal-title":"Proc. 2nd Canadian Conference on Computational Geometry"},{"key":"10.1016\/0925-7721(92)90018-N_BIB14","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0925-7721(92)90018-N_BIB15","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1137\/0218075","article-title":"Computing simple circuits from a set of line segments is NP-complete","volume":"18","author":"Rappaport","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(92)90018-N_BIB16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02187791","article-title":"Computing simple circuits from a set of line segments","volume":"5","author":"Rappaport","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(92)90018-N_BIB17","series-title":"Ph.D. Dissertation","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0925-7721(92)90018-N_BIB18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1090\/S0002-9947-1956-0081471-8","article-title":"A theorem on planar graphs","volume":"82","author":"Tutte","year":"1956","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0925-7721(92)90018-N_BIB19","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1137\/0218080","article-title":"Geometry helps in matching","volume":"18","author":"Vaidya","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(92)90018-N_BIB20","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/1968197","article-title":"A theorem on graphs","volume":"32","author":"Whitney","year":"1931","journal-title":"Ann. Math."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290018N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219290018N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:56:53Z","timestamp":1580900213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219290018N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["092577219290018N"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(92)90018-n","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}