Finding the convex envelope of a boundary datum using random geometric graphs
Abstract
In this paper we approximate the convex envelope of a boundary datum inside a bounded domain in the Euclidean space. We work with a random graph that is obtained as random points with uniform distribution that are connected by proximity ($x\sim y$ when $|x-y|
Fields of Study & Subjects
Point processes and geometric inequalities
Computational Geometry and Mesh Generation
Geometric Analysis and Curvature Flows
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 7 February 2026
- Language
- EN
- Document type
- Preprint