--- res: bibo_abstract: - 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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Bernard foaf_name: Chazelle, Bernard foaf_surname: Chazelle - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Leonidas foaf_name: Guibas, Leonidas foaf_surname: Guibas bibo_doi: 10.1007/BF02187720 bibo_issue: '1' bibo_volume: 4 dct_date: 1989^xs_gYear dct_isPartOf: - http://id.crossref.org/issn/0179-5376 - http://id.crossref.org/issn/1432-0444 dct_language: eng dct_publisher: Springer@ dct_title: The complexity of cutting complexes@ ...