Pages that link to "Item:Q1777281"
From MaRDI portal
The following pages link to Reconstructing curves without Delaunay computation (Q1777281):
Displaying 10 items.
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited (Q1862125) (← links)
- Analysis of curve reconstruction by meshless parameterization (Q1870266) (← links)
- Curve reconstruction from unorganized points (Q1978494) (← links)
- A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\) (Q2020362) (← links)
- Traveling salesman-based curve reconstruction in polynomial time (Q2719129) (← links)
- CURVE RECONSTRUCTION ON RIEMANNIAN MANIFOLDS BY MESHLESS PARAMETERIZATION (Q2968231) (← links)
- Reconstructing curves in three (and higher) dimensional space from noisy data (Q3581291) (← links)
- Curve cuspless reconstruction<i>via</i>sub-Riemannian geometry (Q5495488) (← links)
- Discrete Geometry for Computer Imagery (Q5902445) (← links)
