16 citations · 27 across the 15 of their papers we have counts for
4 papers · 1 filter
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…
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…
An Improved PTAS for Covering Targets with Mobile Sensors
Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo +1
This paper considers a movement minimization problem for mobile sensors. Given a set of point targets, the -Sink Minimum Movement Target Coverage Problem is to schedule mobi…
Folding Every Point on a Polygon Boundary to a Point
Nattawut Phetmak, Jittat Fakcharoenphol
We consider a problem in computational origami. Given a piece of paper as a convex polygon and a point located within, fold every point on a boundary of to and comp…