{"month":"04","date_created":"2018-12-11T12:06:44Z","citation":{"apa":"Edelsbrunner, H., Robison, A., &#38; Shen, X. (1990). Covering convex sets with non-overlapping polygons. <i>Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">https://doi.org/10.1016/0012-365X(90)90147-A</a>","chicago":"Edelsbrunner, Herbert, Arch Robison, and Xiao Shen. “Covering Convex Sets with Non-Overlapping Polygons.” <i>Discrete Mathematics</i>. Elsevier, 1990. <a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">https://doi.org/10.1016/0012-365X(90)90147-A</a>.","ista":"Edelsbrunner H, Robison A, Shen X. 1990. Covering convex sets with non-overlapping polygons. Discrete Mathematics. 81(2), 153–164.","ieee":"H. Edelsbrunner, A. Robison, and X. Shen, “Covering convex sets with non-overlapping polygons,” <i>Discrete Mathematics</i>, vol. 81, no. 2. Elsevier, pp. 153–164, 1990.","ama":"Edelsbrunner H, Robison A, Shen X. Covering convex sets with non-overlapping polygons. <i>Discrete Mathematics</i>. 1990;81(2):153-164. doi:<a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">10.1016/0012-365X(90)90147-A</a>","mla":"Edelsbrunner, Herbert, et al. “Covering Convex Sets with Non-Overlapping Polygons.” <i>Discrete Mathematics</i>, vol. 81, no. 2, Elsevier, 1990, pp. 153–64, doi:<a href=\"https://doi.org/10.1016/0012-365X(90)90147-A\">10.1016/0012-365X(90)90147-A</a>.","short":"H. Edelsbrunner, A. Robison, X. Shen, Discrete Mathematics 81 (1990) 153–164."},"acknowledgement":"The first author acknowledges the support by Amoco Fnd. Fat. Dev. Comput. Sci. l-6-44862. Work on this paper by the second author was supported by a Shell Fellowship in Computer Science. The third author as supported by the office of Naval Research under grant NOOO14-86K-0416. ","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","status":"public","page":"153 - 164","publication_identifier":{"eissn":["1872-681X"],"issn":["0012-365X"]},"extern":"1","type":"journal_article","date_updated":"2022-02-22T15:45:55Z","volume":81,"abstract":[{"lang":"eng","text":"We prove that given n⩾3 convex, compact, and pairwise disjoint sets in the plane, they may be covered with n non-overlapping convex polygons with a total of not more than 6n−9 sides, and with not more than 3n−6 distinct slopes. Furthermore, we construct sets that require 6n−9 sides and 3n−6 slopes for n⩾3. The upper bound on the number of slopes implies a new bound on a recently studied transversal problem."}],"publication_status":"published","publication":"Discrete Mathematics","_id":"4065","doi":"10.1016/0012-365X(90)90147-A","author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Robison","full_name":"Robison, Arch","first_name":"Arch"},{"last_name":"Shen","full_name":"Shen, Xiao","first_name":"Xiao"}],"date_published":"1990-04-15T00:00:00Z","day":"15","publisher":"Elsevier","article_type":"original","year":"1990","language":[{"iso":"eng"}],"intvolume":"        81","publist_id":"2060","oa_version":"None","issue":"2","scopus_import":"1","quality_controlled":"1","title":"Covering convex sets with non-overlapping polygons","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0012365X9090147A?via%3Dihub"}]}