On the maximal number of edges of many faces in an arrangement
Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.
Download (ext.)
https://www.sciencedirect.com/science/article/pii/0097316586900786?via%3Dihub
[Published Version]
Journal Article
| Published
| English
Scopus indexed
Author
Edelsbrunner, HerbertISTA ;
Welzl, Emo
Abstract
Let A be an arrangement of n lines in the plane. Suppose F1,…, Fk are faces in the dissection induced by A and that Fi is a t(Fi)-gon. We give asymptotic bounds on the maximal sum ∑i=1kt(Fi) which can be realized by k different faces in an arrangement of n lines. The results improve known bounds for k of higher order than n(1/2).
Publishing Year
Date Published
1986-11-01
Journal Title
Journal of Combinatorial Theory Series A
Publisher
Elsevier
Acknowledgement
The second author thanks Gan Gusfield for useful discussion.
Volume
41
Issue
2
Page
159 - 166
ISSN
eISSN
IST-REx-ID
Cite this
Edelsbrunner H, Welzl E. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 1986;41(2):159-166. doi:10.1016/0097-3165(86)90078-6
Edelsbrunner, H., & Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. Elsevier. https://doi.org/10.1016/0097-3165(86)90078-6
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A. Elsevier, 1986. https://doi.org/10.1016/0097-3165(86)90078-6.
H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” Journal of Combinatorial Theory Series A, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.
Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.
Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” Journal of Combinatorial Theory Series A, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:10.1016/0097-3165(86)90078-6.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access