Papers › Computable bounds for the reach and r-convexity of subsets of ℝᵈ
Computable bounds for the reach and r-convexity of subsets of ℝᵈ
Ryan Cotsakis
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The convexity of a set can be generalized to the two weaker notions of reach and r-convexity; both describe the regularity of a set's boundary. For any compact subset of ℝᵈ, we provide methods for computing upper bounds on these quantities from point cloud data. The bounds converge to the respective quantities as the point cloud becomes dense in the set, and the rate of convergence for the bound on the reach is given under a weak regularity condition. We also introduce the β-reach, a generalization of the reach that excludes small-scale features of size less than a parameter β∈[0,∞). Numerical studies suggest how the β-reach can be used in high-dimension to infer the reach and other geometric properties of smooth submanifolds.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections