English

Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)

Computational Geometry 2026-04-28 v1

Abstract

We study the common intersection of arrangements of double-wedges. We consider arrangements where double-wedges may be either bowties (which do not contain a vertical line) or hourglasses (which contain a vertical line), in contrast to earlier studies that focused on arrangements of only bowties. This generalization changes the setting drastically, in particular, with respect to all arguments involving the point-line duality. Namely, a point in the intersection of all double-wedges is equivalent to a line that stabs a set of segments S\mathcal{S} (corresponding to the bowties) while it avoids a different set of segments A\mathcal{A} (corresponding to the complement of the hourglasses). We show that in this general setting, the intersection of nn double-wedges may consist of Ω(n2)\Omega(n^2) interior-disjoint regions. Further, we discuss Gallai-type results for arrangements of segments and anti-segments, and we provide algorithms for computing the intersection of such arrangements with worst-case optimal running time. Finally, we also prove that we can find a single intersection point in almost optimal running time, assuming that 3SUM admits no truly subquadratic-time algorithm.

Keywords

Cite

@article{arxiv.2604.23330,
  title  = {Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)},
  author = {Daniel Bertschinger and Henry Förster and Fabian Klute and Irene Parada and Patrick Schnider and Birgit Vogtenhuber},
  journal= {arXiv preprint arXiv:2604.23330},
  year   = {2026}
}