22 citations · 22 across the 2 of their papers we have counts for
2 papers
cs.CG2016
Geometric Hitting Set for Segments of Few Orientations
Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell +2
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. Th…
cs.CG2014★ 22 cited
Efficient Computation of Visibility Polygons
Francisc Bungiu, Michael Hemmer, John Hershberger +2
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations…