3 citations · 3 across the 3 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
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…
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…