Analysis of curve reconstruction by meshless parameterization
From MaRDI portal
A method called meshless parameterization is proposed for curve reconstruction. It is based on mapping the points into the real axis, by solving a sparse linear system, and ordering them. Sufficient discrete conditions on the samples points are derived ensuring that the points are ordered correctly. One such sufficient condition is that the underlying curve be tangent-continuous and free of self-intersections and the sample is dense enough.
Recommendations
Cited in
(10)- PCBC: quasiconformality of point cloud mappings
- Small meshes of curves and their role in the analysis of optimal meshes
- Curve reconstruction from unorganized points
- Analysis of a method to parameterize planar curves immersed in triangulations
- Parameterization of planar curves immersed in triangulations with application to finite elements
- CURVE RECONSTRUCTION ON RIEMANNIAN MANIFOLDS BY MESHLESS PARAMETERIZATION
- Curve fitting when the curve may not be a function
- Curve cuspless reconstructionviasub-Riemannian geometry
- Meshless parameterization and surface reconstruction
- Laplacian spectral basis functions
This page was built for publication: Analysis of curve reconstruction by meshless parameterization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870266)