{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:33Z","timestamp":1760439993699},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":7443,"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":[[1993,3]]},"DOI":"10.1016\/0925-7721(93)90022-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"255-265","source":"Crossref","is-referenced-by-count":10,"title":["Probing polygons minimally is hard"],"prefix":"10.1016","volume":"2","author":[{"given":"Patrice","family":"Belleville","sequence":"first","affiliation":[]},{"given":"Thomas C.","family":"Shermer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90022-X_BIB1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility polygon from an edge","volume":"30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(93)90022-X_BIB2","first-page":"50","article-title":"Probing polygons minimally is hard","author":"Belleville","year":"1991","journal-title":"Proceedings of the Third Canadian Conference in Computational Geometry"},{"key":"10.1016\/0925-7721(93)90022-X_BIB3","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1988"},{"key":"10.1016\/0925-7721(93)90022-X_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0925-7721(93)90022-X_BIB5","series-title":"Master's Thesis","article-title":"An efficient algorithm for identifying objects using robot probes","author":"Lyons","year":"1988"},{"key":"10.1016\/0925-7721(93)90022-X_BIB6","series-title":"Computational Geometry, an Introduction","author":"Preparata","year":"1988"},{"key":"10.1016\/0925-7721(93)90022-X_BIB7","series-title":"Ph.D. Thesis","article-title":"Geometric probing","author":"Skiena","year":"1988"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390022X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390022X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:26Z","timestamp":1555131086000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390022X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["092577219390022X"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90022-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}