Stabbing segments with rectilinear objects

Mercè Claverol, Delia Garijo, Matias Korman, Carlos Seara, Rodrigo I. Silveira

Research output: Contribution to journalArticlepeer-review


Given a set S of n line segments in the plane, we say that a region R⊆R2 is a stabber for S if R contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-parallel halfplanes (thus the stabbers are halfplanes, strips, quadrants, 3-sided rectangles, or rectangles). The running times are O(n) (for the halfplane case), O(nlog n) (for strips, quadrants, and 3-sided rectangles), and O(n2log n) (for rectangles).

Original languageEnglish
Pages (from-to)359-373
Number of pages15
JournalApplied Mathematics and Computation
Publication statusPublished - 2017 Sept 15


  • Algorithms
  • Classification problems
  • Computational geometry
  • Line segments
  • Stabbing problems

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Stabbing segments with rectilinear objects'. Together they form a unique fingerprint.

Cite this