Gauss--Chebyshev Quadrature, $\mathbb S^1$-Designs, and the Planar Minkowski Inverse Problem: A One-Dimensional Model for Design-Induced Convex Geometry

Abstract: We study the relation between equal-weight circle quadrature, Gauss--Chebyshev quadrature, and planar Minkowski reconstruction. The regular $N$-point grid is an $\mathbb S<sup>1$-design of strength $N-1$; a half-step rotation of the $2M$-point grid projects to the classical $M$-point Gauss--Chebyshev rule. A common family of quadrature-error functionals gives exact identities for integration error, mixed-area error, and support-function error. For $N\ge3$, the centered Minkowski polygon $P_N$ with perimeter $2π$ has the exact Hausdorff distance from the unit disk $B<sup>2$ [ d_H(P_N,B^2)=1-\fracπ{N}\cot\fracπ{N} =\frac{π^2}{3N^2}+O(N^{-4}). ] With Steiner centering, we obtain $d_H(K_μ,K_ν)\leπW_1(μ,ν)$ for balanced, nondegenerate probability measures, where $W_1$ uses geodesic distance. Its exponent is sharp even for smooth positive densities near the uniform measure. The identity $W_1(ν_N,σ)=π/(2N)$ yields a general $O(N<sup>{-1})$ bound for the regular grid. The sharper $O(N<sup>{-2})$ rate follows from the sparse discrepancy spectrum and the inverse multiplier $(1-k<sup>2)<sup>{-1}$. Finally, a perturbation estimate gives sufficient conditions for preserving the quadratic rate and its leading constant.