Analyzing the squared distance-to-measure gradient flow system with \(k\)-order Voronoi diagrams

DOI10.1007/s00454-018-0037-6zbMath1411.65030OpenAlexW2897037714MaRDI QIDQ1739199

Thomas Wanner, Patrick E. O'Neil

Publication date: 25 April 2019

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-018-0037-6

zbMATH Keywords

Voronoi diagramstopological data analysispoint clouddata smoothingdistance-to-measure function

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

On the structure of higher order Voronoi cells

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rates of convergence for robust geometric inference
• Geometric inference for probability measures
• Boundary measures for geometric inference
• Some applications of Filippov's dynamical systems
• Piecewise-smooth dynamical systems. Theory and applications
• A Topological View of Unsupervised Learning from Noisy Data
• Curve and Surface Reconstruction
• Robust Topological Inference: Distance To a Measure and Kernel Distance
• Witnessed k-distance

This page was built for publication: Analyzing the squared distance-to-measure gradient flow system with \(k\)-order Voronoi diagrams