On the maximal number of edges of many faces in an arrangement

DOI10.1016/0097-3165(86)90078-6zbMath0585.52002OpenAlexW2059759859WikidataQ54309939 ScholiaQ54309939MaRDI QIDQ1071264

Ermo Welzl, Herbert Edelsbrunner

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(86)90078-6

zbMATH Keywords

dissection of the real projective planefaces in arrangements of n linespartitions into regions

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Other problems of combinatorial convexity (52A37)

Related Items

The complexity of cells in three-dimensional arrangements, Convex polygons made from few lines and convex decompositions of polyhedra, Triangles in space or building (and analyzing) castles in the air, The common exterior of convex polygons in the plane, Erased arrangements of linear and convex decompositions of polyhedra, Drawing graphs using a small number of obstacles, Combinatorial complexity bounds for arrangements of curves and spheres, Partitioning arrangements of lines. II: Applications, Counting facets and incidences, The number of edges of many faces in a line segment arrangement, The complexity and construction of many faces in arrangements of lines and of segments, The complexity of many cells in arrangements of planes and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• The maximal sizes of faces and vertices in an arrangement
• Stabbing line segments
• A theorem on arrangements of lines in the plane
• Constructing Belts in Two-Dimensional Arrangements with Applications
• The Polygonal Regions into which a Plane is Divided by n Straight Lines