{"publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"type":"journal_article","month":"01","date_published":"1988-01-01T00:00:00Z","oa_version":"None","date_created":"2018-12-11T12:06:53Z","article_type":"original","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","title":"Probing convex polygons with X-Rays","extern":"1","intvolume":"        17","citation":{"ieee":"H. Edelsbrunner and S. Skiena, “Probing convex polygons with X-Rays,” <i>SIAM Journal on Computing</i>, vol. 17, no. 5. SIAM, pp. 870–882, 1988.","apa":"Edelsbrunner, H., &#38; Skiena, S. (1988). Probing convex polygons with X-Rays. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0217054 \">https://doi.org/10.1137/0217054 </a>","mla":"Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” <i>SIAM Journal on Computing</i>, vol. 17, no. 5, SIAM, 1988, pp. 870–82, doi:<a href=\"https://doi.org/10.1137/0217054 \">10.1137/0217054 </a>.","chicago":"Edelsbrunner, Herbert, and Steven Skiena. “Probing Convex Polygons with X-Rays.” <i>SIAM Journal on Computing</i>. SIAM, 1988. <a href=\"https://doi.org/10.1137/0217054 \">https://doi.org/10.1137/0217054 </a>.","short":"H. Edelsbrunner, S. Skiena, SIAM Journal on Computing 17 (1988) 870–882.","ama":"Edelsbrunner H, Skiena S. Probing convex polygons with X-Rays. <i>SIAM Journal on Computing</i>. 1988;17(5):870-882. doi:<a href=\"https://doi.org/10.1137/0217054 \">10.1137/0217054 </a>","ista":"Edelsbrunner H, Skiena S. 1988. Probing convex polygons with X-Rays. SIAM Journal on Computing. 17(5), 870–882."},"author":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Steven","last_name":"Skiena","full_name":"Skiena, Steven"}],"scopus_import":"1","quality_controlled":"1","abstract":[{"lang":"eng","text":"An X-ray probe through a polygon measures the length of intersection between a line and the polygon. This paper considers the properties of various classes of X-ray probes, and shows how they interact to give finite strategies for completely describing convex n-gons. It is shown that (3n/2)+6 probes are sufficient to verify a specified n-gon, while for determining convex polygons (3n-1)/2 X-ray probes are necesssary and 5n+O(1) sufficient, with 3n+O(1) sufficient given that a lower bound on the size of the smallest edge of P is known."}],"day":"01","publisher":"SIAM","volume":17,"year":"1988","language":[{"iso":"eng"}],"publication_status":"published","doi":"10.1137/0217054 ","issue":"5","publist_id":"2030","page":"870 - 882","acknowledgement":"The research of this author was supported by the Amoco Foundation Facility for the Development of Computer Science 1-6-44862.","date_updated":"2022-02-08T11:14:23Z","main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0217054"}],"publication":"SIAM Journal on Computing","_id":"4091"}