Certified rational nets and a budgeted mesh theorem

For binary laws the parameter $p(0)$ identifies the simplex with $[0,1]$, and total variation is ordinary absolute distance. Thus the covering radius is half the largest gap between successive net points.