Computable bounds for the reach and \(r\)-convexity of subsets of \({{\mathbb{R}}}^d\)

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Global geometric and topological methods (à la Gromov); differential geometric analysis on metric spaces (53C23)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Ripser: efficient computation of Vietoris-Rips persistence barcodes
A multivariate uniformity test for the case of unknown support
Geometry-driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape
A sampling theory for compact sets in Euclidean space
Lipschitz-Killing curvatures of excursion sets for two-dimensional random fields
Nonasymptotic rates for manifold, tangent space and curvature estimation
Approximating the medial axis from the Voronoi diagram with a convergence guarantee
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
On the estimation of the medial axis and inner parallel body
Minimax adaptive estimation in manifold inference
The effect of discretization on the mean geometry of a 2D random field
Estimating the reach of a manifold via its convexity defect function
Estimation of surface area
The reach, metric distortion, geodesic convexity and the variation of tangent spaces
Estimating the reach of a manifold
Finding the homology of submanifolds with high confidence from random samples
Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
A nonparametric approach to the estimation of lengths and surface areas
On statistical properties of sets fulfilling rolling-type conditions
A fully data-driven method for estimating the shape of a point cloud
Sur les ensembles ε-convexes
Curvature Measures
Length and surface area estimation under smoothness restrictions
Locally uniform anisotropic meshing
A new distribution-free quantile estimator
Multidimensional binary search trees used for associative searching
Local differentiability of distance functions
On boundary estimation
Geometry and Topology for Mesh Generation
Random Fields and Geometry
Weak feature size and persistent homology
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
Normal and Feature Approximations from Noisy Point Clouds
Universally consistent estimation of the reach
Optimal reach estimation and metric learning
A counter example on a Borsuk conjecture
On the perimeter estimation of pixelated excursion sets of two‐dimensional anisotropic random fields
Hausdorff and Gromov-Hausdorff stable subsets of the medial axis
Surface area and volume of excursion sets observed on point cloud based polytopic tessellations

This page was built for publication: Computable bounds for the reach and \(r\)-convexity of subsets of \({{\mathbb{R}}}^d\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6662768)