5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.CG2015★ 5 cited
Tighter Estimates for epsilon-nets for Disks
Norbert Bus, Shashwat Garg, Nabil H. Mustafa +1
The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set of points, and a set of geometric objects in the…
cs.CG2014
Counting Triangulations and other Crossing-Free Structures Approximately
Victor Alvarez, Karl Bringmann, Saurabh Ray +1
We consider the problem of counting straight-edge triangulations of a given set of points in the plane. Until very recently it was not known whether the exact number of tri…