Stabbing segments with rectilinear objects

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


We consider stabbing regions for a set S of n line segments in the plane, that is, regions in the plane that contain exactly one endpoint of each segment of S. Concretely, we provide efficient algorithms for reporting all combinatorially different stabbing regions for S for regions that can be described as the intersection of axis-parallel halfplanes; these are halfplanes, strips, quadrants, 3-sided rectangles, and rectangles. The running times are O(n) (for the halfplane case), O(n log n) (for strips, quadrants, and 3-sided rectangles), and O(n2 log n) (for rectangles).

Original languageEnglish
Title of host publicationFundamentals of Computation Theory - 20th International Symposium, FCT 2015, Proceedings
EditorsIgor Walukiewicz, Adrian Kosowski
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783319221762
Publication statusPublished - 2015
Externally publishedYes
Event20th International Symposium on Fundamentals of Computation Theory, FCT 2015 - Gdansk, Poland
Duration: 2015 Aug 172015 Aug 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other20th International Symposium on Fundamentals of Computation Theory, FCT 2015

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


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

Cite this