{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:02:07Z","timestamp":1648872127250},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":3669,"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":[[2003,7]]},"DOI":"10.1016\/s0925-7721(02)00113-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:26:08Z","timestamp":1051737968000},"page":"257-265","source":"Crossref","is-referenced-by-count":0,"title":["The visibility graph of congruent discs is Hamiltonian"],"prefix":"10.1016","volume":"25","author":[{"given":"David","family":"Rappaport","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00113-X_BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90109-4","article-title":"A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs","volume":"7","author":"Asano","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(02)00113-X_BIB002","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0925-7721(02)00113-X_BIB003","series-title":"Proc. First Pacific Conf. Computer Graphics Appl., Seoul, Korea, Vol. 1","first-page":"90","article-title":"Growing a tree from its branches","author":"Bose","year":"1993"},{"key":"10.1016\/S0925-7721(02)00113-X_BIB004","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\/S0925-7721(02)00113-X_BIB005","series-title":"History, The Traveling Salesman Problem","author":"Hoffman","year":"1985"},{"key":"10.1016\/S0925-7721(02)00113-X_BIB006","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/34.6790","article-title":"Computing the width of a set","volume":"5","author":"Houle","year":"1988","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. PAMI-10"},{"issue":"2\u20133","key":"10.1016\/S0925-7721(02)00113-X_BIB007","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0166-218X(00)00270-5","article-title":"On the visibility graph of convex translates","volume":"113","author":"Hosono","year":"2001","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0925-7721(02)00113-X_BIB008","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(01)00209-8","article-title":"On the perfect matching of disjoint compact sets by noncrossing line segments in Rn","volume":"118","author":"Hosono","year":"2002","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/S0925-7721(02)00113-X_BIB009","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0925-7721(92)90018-N","article-title":"Hamiltonian triangulations and circumscribing polygons of disjoint line segments","volume":"2","author":"Mirzaian","year":"1992","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00113-X_BIB010","series-title":"Visibility, Handbook of Discrete and Computational Geometry","author":"O'Rourke","year":"1997"},{"key":"10.1016\/S0925-7721(02)00113-X_BIB011","series-title":"Computational Geometry in C","author":"O'Rourke","year":"1998"},{"issue":"6","key":"10.1016\/S0925-7721(02)00113-X_BIB012","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."},{"issue":"3","key":"10.1016\/S0925-7721(02)00113-X_BIB013","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0925-7721(92)90015-K","article-title":"A convex hull algorithm for discs, and applications","volume":"1","author":"Rappaport","year":"1992","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(02)00113-X_BIB014","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/BF01910638","article-title":"Clamping a polygon","volume":"10","author":"Souvaine","year":"1994","journal-title":"Visual Comput."},{"key":"10.1016\/S0925-7721(02)00113-X_BIB015","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:S092577210200113X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S092577210200113X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T21:21:27Z","timestamp":1553635287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092577210200113X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S092577210200113X"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00113-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}