The number of edges of many faces in a line segment arrangement (Q1200271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of edges of many faces in a line segment arrangement |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of edges of many faces in a line segment arrangement |
scientific article |
Statements
The number of edges of many faces in a line segment arrangement (English)
0 references
17 January 1993
0 references
Associated with an arrangement of \(n\) line segments in the Euclidean plane is a subdivision of the plane consisting of vertices, edges and faces. It is proved that the maximum number of edges bounding \(m\) faces in an arrangement of \(n\) line segments in the plane is \(O(m^{2/3} n^{2/3}+n\alpha(n)+n \log m)\), with \(\alpha(n)\) the functional inverse of the Ackermann function.
0 references
combinatorial complexity
0 references
arrangement of \(n\) line segments
0 references
Euclidean plane
0 references
maximum number of edges
0 references
