2 papers
cs.CG2026
Covering Planar Lattices with Interior-Disjoint Unit Disks
Nattawut Phetmak, Grittin Nuntasombat, Jittat Fakcharoenphol
We study an infinite variant of the coin-covering problem for periodic point sets in the plane. Given a point set of spacing , we ask whether all of its points can be covered by…
cs.CG2026
Robust Bichromatic Classification in 3D Using Planes and Slices
Grittin Nuntasombat, Nattawut Phetmak, Jittat Fakcharoenphol
Given two sets of points in 3-dimensional space and , we want to separate these two sets of points using a classifier based on linear constraints, while ensuring robustness…