{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T19:15:29Z","timestamp":1698002129056},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":8932,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0095-8956(89)90008-7","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"66-83","source":"Crossref","is-referenced-by-count":8,"title":["An upper bound on the shortness exponent of inscribable polytopes"],"prefix":"10.1016","volume":"46","author":[{"given":"Michael B","family":"Dillencourt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"No. 4","key":"10.1016\/0095-8956(89)90008-7_BIB1","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/357346.357349","article-title":"Geometric structures for three-dimensional storage representation","volume":"3","author":"Boissonat","year":"1984","journal-title":"ACM Trans. Graphics"},{"issue":"No. 5","key":"10.1016\/0095-8956(89)90008-7_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","article-title":"Voronoi diagrams from convex hulls","volume":"9","author":"Brown","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"No. 3","key":"10.1016\/0095-8956(89)90008-7_BIB3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and Hamiltonian circuits","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"issue":"No. 6","key":"10.1016\/0095-8956(89)90008-7_BIB4","first-page":"793","article-title":"Sur la Sph\u00e8re Vide","volume":"7","author":"Delaunay","year":"1934","journal-title":"Izv. Akad Nauk SSSR Otd. Mat. Estestv. Nauk Ser. VII"},{"issue":"No. 3","key":"10.1016\/0095-8956(89)90008-7_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(87)90124-4","article-title":"A non-Hamiltonian, nondegenerate Delaunay triangulation","volume":"25","author":"Dillencourt","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0095-8956(89)90008-7_BIB6_1","series-title":"Proceedings of the Third ACM Symposium on Computational Geometry","first-page":"186","article-title":"Toughness and Delaunay triangulations","author":"Dillencourt","year":"1987"},{"key":"10.1016\/0095-8956(89)90008-7_BIB6_2","article-title":"Toughness and Delaunay triangulations","author":"Dillencourt","year":"1987","journal-title":"University of Maryland Computer Science Department Technical Report CS-TR-1825"},{"issue":"No. 1","key":"10.1016\/0095-8956(89)90008-7_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","article-title":"Vorono\u00ef diagrams and arrangements","volume":"1","author":"Edelsbrunner","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0095-8956(89)90008-7_BIB8","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0095-8956(89)90008-7_BIB9","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0097-3165(73)90012-5","article-title":"Shortness exponents of families of graphs","volume":"14","author":"Gr\u00fcnbaum","year":"1973","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0095-8956(89)90008-7_BIB10","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(89)90008-7_BIB11","first-page":"11","article-title":"Traveling salesman cycles are not always subgraphs of Vorono\u00ef duals","volume":"16","author":"Kantabutra","year":"1983"},{"issue":"No. 2","key":"10.1016\/0095-8956(89)90008-7_BIB12","doi-asserted-by":"crossref","first-page":"629","DOI":"10.2140\/pjm.1963.13.629","article-title":"Simple paths on polyhedra","volume":"13","author":"Moon","year":"1963","journal-title":"Pacific J. Math."},{"issue":"No. 1","key":"10.1016\/0095-8956(89)90008-7_BIB13_1","first-page":"17","article-title":"The computational geometry column","volume":"18","author":"O'Rourke","year":"1986","journal-title":"SIGACT News"},{"issue":"No. 5","key":"10.1016\/0095-8956(89)90008-7_BIB13_2","first-page":"232","article-title":"The computational geometry column","volume":"20","author":"O'Rourke","year":"1986","journal-title":"Comput. Graphics"},{"issue":"No. 2","key":"10.1016\/0095-8956(89)90008-7_BIB14","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0734-189X(87)80169-X","article-title":"Connect-the-dots: A new heuristic","volume":"39","author":"O'Rourke","year":"1987","journal-title":"Comput. Vision, Graphics, and Image Processing"},{"key":"10.1016\/0095-8956(89)90008-7_BIB15","author":"Preparata","year":"1985"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895689900087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:53:27Z","timestamp":1548777207000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895689900087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0095895689900087"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(89)90008-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}