{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:17:09Z","timestamp":1759335429178},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00270-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:10:32Z","timestamp":1027599032000},"page":"195-210","source":"Crossref","is-referenced-by-count":4,"title":["On the visibility graph of convex translates"],"prefix":"10.1016","volume":"113","author":[{"given":"Kiyoshi","family":"Hosono","sequence":"first","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"David","family":"Rappaport","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00270-5_BIB1","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\/S0166-218X(00)00270-5_BIB2","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0166-218X(00)00270-5_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(00)00270-5_BIB4","unstructured":"P. Bose, G. Toussaint, Growing a tree from its branches, Proceedings of First Pacific Conference Computer Graphics Applications, Seoul, Korea, Vol. 1, World Scientific, Singapore, 1993, pp. 90\u201399."},{"key":"10.1016\/S0166-218X(00)00270-5_BIB5","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\/S0166-218X(00)00270-5_BIB6","series-title":"The Handbook of Discrete and Computational Geometry","author":"Goodmann","year":"1997"},{"key":"10.1016\/S0166-218X(00)00270-5_BIB7","unstructured":"K. Hosono, K. Matsuda, On the perfect matching of disjoint convex sets by line segments, (1998), submitted for publication."},{"issue":"1","key":"10.1016\/S0166-218X(00)00270-5_BIB8","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":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0166-218X(00)00270-5_BIB9","series-title":"Computational Geometry in C","author":"O'Rourke","year":"1998"},{"issue":"6","key":"10.1016\/S0166-218X(00)00270-5_BIB10","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\/S0166-218X(00)00270-5_BIB11","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1090\/S0002-9939-1964-0161221-7","article-title":"Convex polygons","volume":"15","author":"Sobcyk","year":"1964","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0166-218X(00)00270-5_BIB12","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002705?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002705?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:52:59Z","timestamp":1556257979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00002705"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00270-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}