The complexity of cells in 3-dimensional arrangements

H. Edelsbrunner, D. Haussler, Discrete Mathematics 60 (1986) 139–146.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Author
Abstract
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.
Publishing Year
Date Published
1986-06-01
Journal Title
Discrete Mathematics
Volume
60
Issue
C
Page
139 - 146
IST-REx-ID

Cite this

Edelsbrunner H, Haussler D. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 1986;60(C):139-146. doi:10.1016/0012-365X(86)90008-7
Edelsbrunner, H., & Haussler, D. (1986). The complexity of cells in 3-dimensional arrangements. Discrete Mathematics, 60(C), 139–146. https://doi.org/10.1016/0012-365X(86)90008-7
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics 60, no. C (1986): 139–46. https://doi.org/10.1016/0012-365X(86)90008-7.
H. Edelsbrunner and D. Haussler, “The complexity of cells in 3-dimensional arrangements,” Discrete Mathematics, vol. 60, no. C, pp. 139–146, 1986.
Edelsbrunner H, Haussler D. 1986. The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. 60(C), 139–146.
Edelsbrunner, Herbert, and David Haussler. “The Complexity of Cells in 3-Dimensional Arrangements.” Discrete Mathematics, vol. 60, no. C, Elsevier, 1986, pp. 139–46, doi:10.1016/0012-365X(86)90008-7.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar