On the notion of polynomial reach: a statistical application
Alejandro Cholaquidis, Antonio Cuevas, Leonardo Moreno

TL;DR
This paper introduces a statistical method to estimate the polynomial reach of a set in Euclidean space using random samples, enabling the approximation of geometric features like volume and boundary measure without smoothing parameters.
Contribution
It proposes a novel statistical approach to approximate the polynomial reach and related geometric features of sets with polynomial volume functions, extending beyond classical positive reach conditions.
Findings
Method accurately estimates polynomial reach from samples
Enables geometric feature estimation without smoothing parameters
Applicable to sets with polynomial volume functions beyond convexity
Abstract
The volume function V(t) of a compact set S\in R^d is just the Lebesgue measure of the set of points within a distance to S not larger than t. According to some classical results in geometric measure theory, the volume function turns out to be a polynomial, at least in a finite interval, under a quite intuitive, easy to interpret, sufficient condition (called ``positive reach'') which can be seen as an extension of the notion of convexity. However, many other simple sets, not fulfilling the positive reach condition, have also a polynomial volume function. To our knowledge, there is no general, simple geometric description of such sets. Still, the polynomial character of has some relevant consequences since the polynomial coefficients carry some useful geometric information. In particular, the constant term is the volume of S and the first order coefficient is the boundary measure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Statistical Methods and Models · Point processes and geometric inequalities · Statistical and numerical algorithms
