3 citations · 13 across the 20 of their papers we have counts for
4 papers · 1 filter
On the Minimum Consistent Subset Problem
Ahmad Biniaz, Sergio Cabello, Paz Carmi +4
Let be a set of colored points in the plane. Introduced by Hart (1968), a consistent subset of , is a set such that for every point in ,…
Plane and Planarity Thresholds for Random Geometric Graphs
Ahmad Biniaz, Evangelos Kranakis, Anil Maheshwari +1
A random geometric graph, , is formed by choosing points independently and uniformly at random in a unit square; two points are connected by a straight-line edge if the…
Closest-Pair Queries in Fat Rectangles
Sang Won Bae, Michiel Smid
In the range closest pair problem, we want to construct a data structure storing a set of points in the plane, such that for any axes-parallel query rectangle , the clos…
Faster Algorithms for some Optimization Problems on Collinear Points
Ahmad Biniaz, Prosenjit Bose, Paz Carmi +3
We propose faster algorithms for the following three optimization problems on collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in…