Reconstructing curves without Delaunay computation
From MaRDI portal
Recommendations
Cited in
(17)- Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
- Analysis of curve reconstruction by meshless parameterization
- Curve reconstruction from unorganized points
- A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\)
- On the curve reconstruction in Riemannian manifolds
- Traveling salesman-based curve reconstruction in polynomial time
- CURVE RECONSTRUCTION ON RIEMANNIAN MANIFOLDS BY MESHLESS PARAMETERIZATION
- Curve and Surface Reconstruction
- Reconstructing curves in three (and higher) dimensional space from noisy data
- Intelligent Solutions for Curve Reconstruction Problem
- Contour reconstruction for multiple 2D regions based on adaptive boundary samples
- Reachability by paths of bounded curvature in a convex polygon
- scientific article; zbMATH DE number 1979489 (Why is no real title available?)
- Curve reconstruction from noisy samples
- Curve cuspless reconstructionviasub-Riemannian geometry
- Towards an invertible Euclidean reconstruction of a discrete object.
- Tighter bounds for reconstruction from \(\varepsilon\)-samples
This page was built for publication: Reconstructing curves without Delaunay computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777281)