On simple arrangements of lines and pseudo-lines in P^2 and R^2 with the maximum number of triangles
Nicolas Bartholdi, J\'er\'emy Blanc, S\'ebastien Loisel

TL;DR
This paper explores the maximum number of triangles formed in simple arrangements of lines and pseudo-lines in two-dimensional and projective planes, providing new theoretical bounds and insights.
Contribution
It introduces new bounds and methods for counting triangles in arrangements of lines and pseudo-lines, advancing the understanding of their combinatorial properties.
Findings
Established new upper bounds for the number of triangles
Identified configurations that maximize triangle counts
Extended results to pseudo-line arrangements
Abstract
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Mathematics and Applications
