The complexity of cutting complexes
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
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.
- Connelly, R. and Henderson, D. W., A convex 3-complex is not simplicially isomorphic to a strictly convex complex,Math. Proc. Cambridge Philos. Soc. 88 (1980), 299–306.
- Edelsbrunner, H.,Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, 1987.
- 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.
- Grünbaum, B.,Convex Polytopes, Wiley, New York, 1967.
- Guibas, L. J. and Stolfi, J., Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,ACM Trans. Graphics 4 (1985), 75–123. CrossRef
- 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.
- Hall, M.,Combinatorial Theory, Blaisdell, Waltham, MA, 1967.
- Moser, W. and Pach, J., Research Problems in Discrete Geometry, Manuscript, 1986.
- Zaslavsky, Th., Facing up to arrangements: face-count formulas for partitions of space by hyperplanes,Mem. Amer. Math. Soc. 154 (1975), 1–71.
- The complexity of cutting complexes
Discrete & Computational Geometry
Volume 4, Issue 1 , pp 139-181
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- Author Affiliations
- 1. Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA
- 2. Department of Computer Science, University of Illinois, 61801, Urbana, IL, USA
- 3. Department of Computer Science, Stanford University/DEC-SRC, 94301, Palo Alto, CA, USA