On the zone of a circle in an arrangement of lines
Gabriel Nivasch

TL;DR
This paper investigates the complexity of the zone of a circle in line arrangements, providing geometric arguments to support the conjecture that it is linear, and analyzing the combinatorial structure of related sequences.
Contribution
It introduces geometric constraints on line segments with endpoints on a circle, ruling out certain complex configurations and connecting sequence properties to zone complexity.
Findings
Certain configurations of line segments on a circle are impossible.
Hart-Sharir sequences cannot appear as subsequences in the sequence representing the zone.
A link is established between sequence properties and the linearity of zone complexity.
Abstract
Let be a set of lines in the plane, and let be a convex curve in the plane, like a circle or a parabola. The "zone" of in , denoted , is defined as the set of all cells in the arrangement that are intersected by . Edelsbrunner et al. (1992) showed that the complexity (total number of edges or vertices) of is at most , where is the inverse Ackermann function. They did this by translating the sequence of edges of into a sequence that avoids the subsequence . Whether the worst-case complexity of is only linear is a longstanding open problem. Since the relaxation of the problem to pseudolines does have a bound, any proof of for the case of straight 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 · Point processes and geometric inequalities
