3 citations · 4 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CG2019
Hardness and Approximation of Minimum Convex Partition
Nicolas Grelier
We consider the Minimum Convex Partition problem: Given a set P of n points in the plane, draw a plane graph G on P, with positive minimum degree, such that G partitions the convex…
cs.CG2019★ 3 cited
On the VC-dimension of half-spaces with respect to convex sets
Nicolas Grelier, Saeed Gh. Ilchi, Tillmann Miltzow +1
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that f…