The complexity of cutting complexes
- 71 Downloads
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.
Unable to display preview. Download preview PDF.
- [EG]Edelsbrunner, H. and Guibas, L. J., Topologically sweeping an arrangement, Tech. Rep. 9, DEC/SRC, April 1986. Also,Proc. 18th STOC, 1986, pp. 389–403.Google Scholar
- [GY]Guibas, L. J. and Yao, F. F., On translating a set of rectangles, inAdvances in Computing Research, Vol. 1 (F. P. Preparata, ed.), JAI Press, Greenwich, CT, 1983, pp. 61–77.Google Scholar
- [MP]Moser, W. and Pach, J., Research Problems in Discrete Geometry, Manuscript, 1986.Google Scholar