{"day":"01","year":"1986","article_type":"original","publisher":"Elsevier","date_published":"1986-06-01T00:00:00Z","publist_id":"2019","language":[{"iso":"eng"}],"intvolume":"        60","title":"The complexity of cells in 3-dimensional arrangements","quality_controlled":"1","oa_version":"None","issue":"C","article_processing_charge":"No","acknowledgement":"Research reported in the paper was conducted while the second author was visiting the Technical University of Graz. Support provided by the Technical University for this visit is gratefully acknowledged. ","date_created":"2018-12-11T12:06:59Z","month":"06","citation":{"ieee":"H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” <i>Discrete Mathematics</i>, vol. 60, no. C. Elsevier, pp. 139–146, 1986.","short":"H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.","mla":"Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” <i>Discrete Mathematics</i>, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:<a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">10.1016/0012-365X(86)90008-7</a>.","ama":"Edelsbrunner H, Haussler D. The complexity of cells in 3-dimensional arrangements. <i>Discrete Mathematics</i>. 1986;60(C):139-146. doi:<a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">10.1016/0012-365X(86)90008-7</a>","apa":"Edelsbrunner, H., &#38; Haussler, D. (1986). The complexity of cells in 3-dimensional arrangements. <i>Discrete Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">https://doi.org/10.1016/0012-365X(86)90008-7</a>","ista":"Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.","chicago":"Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” <i>Discrete Mathematics</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0012-365X(86)90008-7\">https://doi.org/10.1016/0012-365X(86)90008-7</a>."},"page":"139 - 146","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","extern":"1","volume":60,"date_updated":"2022-02-01T12:44:50Z","publication_identifier":{"issn":["0012-365X"],"eissn":["1872-681X"]},"doi":"10.1016/0012-365X(86)90008-7","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"David","full_name":"Haussler, David","last_name":"Haussler"}],"_id":"4107","abstract":[{"text":"A set of m planes dissects E3 into cells, facets, edges and vertices. Letting deg(c) be the number of facets that bound a cellc, we give exact and asymptotic bounds on the maximum of ∈cinCdeg(c), if C is a family of cells of the arrangement with fixed cardinality.","lang":"eng"}],"publication_status":"published","publication":"Discrete Mathematics"}