{"acknowledgement":"Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. We wish to thank J. Pach and E. Szemeredi for valuable discussions on several\r\nof the problems studied in this paper.","article_processing_charge":"No","citation":{"ieee":"B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 139–181, 1989.","mla":"Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>.","ama":"Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):139-181. doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete &#38; Computational Geometry 4 (1989) 139–181.","apa":"Chazelle, B., Edelsbrunner, H., &#38; Guibas, L. (1989). The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>","ista":"Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &#38; Computational Geometry. 4(1), 139–181.","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>."},"month":"03","date_created":"2018-12-11T12:06:54Z","status":"public","page":"139 - 181","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-02-10T10:25:57Z","volume":4,"extern":"1","type":"journal_article","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"_id":"4093","doi":"10.1007/BF02187720","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"}],"publication_status":"published","publication":"Discrete & Computational Geometry","abstract":[{"lang":"eng","text":"This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed."}],"year":"1989","publisher":"Springer","day":"01","date_published":"1989-03-01T00:00:00Z","publist_id":"2032","intvolume":"         4","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187720"}],"quality_controlled":"1","title":"The complexity of cutting complexes","issue":"1","oa_version":"None"}