Conditional constrained and unconstrained quantization for uniform distributions on regular polygons
Christina Hamilton, Evans Nyanney, Megha Pandey, Mrinal K. Roychowdhury
TL;DR
This work develops a unified framework for conditional constrained and unconstrained quantization of a uniform distribution on a regular polygon, with the vertex set as the conditioning baseline. Leveraging polygonal symmetry through a rotation map $T$, the authors derive exact structural forms for conditional optimal $n$-point sets when $n\ge k$, and obtain closed-form expressions for the distortion $V_n$, leading to the result that the conditional quantization dimension $D(P)=1$ and the conditional quantization coefficient is $\frac{2}{3} k^2 \sin^3(\pi/k)$. The paper then extends the analysis to constrained quantization under circumcircle, incircle, and diagonal constraints, providing explicit constructions and quantitative $V_n$ values, particularly for the hexagon. The results contribute a general, symmetry-based methodology for polygonal supports and offer concrete, computable guidance for applications where preassigned centers or geometric constraints influence optimal quantization, with potential relevance to resource placement and medical physics. Overall, the work establishes foundational theory and actionable examples for conditional and constrained quantization on polygonal domains.
Abstract
In this paper, we have considered a uniform distribution on a regular polygon with $k$-sides for some $k\geq 3$ and the set of all its $k$ vertices as a conditional set. For the uniform distribution under the conditional set first, for all positive integers $n\geq k$, we obtain the conditional optimal sets of $n$-points and the $n$th conditional quantization errors, and then we calculate the conditional quantization dimension and the conditional quantization coefficient in the unconstrained scenario. Then, for the uniform distribution on the polygon taking the same conditional set, we investigate the conditional constrained optimal sets of $n$-points and the conditional constrained quantization errors for all $n \geq 6$, taking the constraint as the circumcircle, incircle, and then the different diagonals of the polygon.
