3 papers
cs.CG2026
Implicit representations via the polynomial method
Jean Cardinal, Micha Sharir
Semialgebraic graphs are graphs whose vertices are points in , and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of con…
math.CO2025
Compact Representation of Semilinear and Terrain-like Graphs
Jean Cardinal, Yelena Yuditsky
We consider the existence and construction of \textit{biclique covers} of graphs, consisting of coverings of their edge sets by complete bipartite graphs. The \textit{size} of such…
cs.CG2025
Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization
Jean Cardinal, Xavier Goaoc, Sarah Wajsbrot
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set…