Curve reconstruction from noisy samples

DOI10.1016/j.comgeo.2004.07.004zbMath1070.65013OpenAlexW4213309197WikidataQ62041840 ScholiaQ62041840MaRDI QIDQ1775779

Sheung-Hung Poon, Piyush Kumar, Stefan Funke, Siu-Wing Cheng, Mordecai J. Golin, Edgar A. Ramos

Publication date: 4 May 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.07.004

zbMATH Keywords

algorithmprobabilistic analysiscomputational geometrycurve reconstruction

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Solution manifold and its statistical applications ⋮ Asymptotic theory for density ridges ⋮ Spectral edge detection in two dimensions using wavefronts ⋮ Only distances are required to reconstruct submanifolds ⋮ Reconstruction using witness complexes ⋮ The Geometry of Nonparametric Filament Estimation ⋮ Point ordering with natural distance based on Brownian motion ⋮ PROVABLE DIMENSION DETECTION USING PRINCIPAL COMPONENT ANALYSIS

Cites Work

• Unnamed Item
• Unnamed Item
• Rotational and helical surface approximation for reverse engineering
• Probabilistic methods for algorithmic discrete mathematics
• Algorithms for ordering unorganized points along parametrized curves
• Curve reconstruction, the Traveling Salesman Problem, and Menger's theorem on length
• Curve reconstruction: Connecting dots with good reason
• Curve reconstruction from unorganized points
• Provable surface reconstruction from noisy samples
• Traveling Salesman-Based Curve Reconstruction in Polynomial Time
• The approximation power of moving least-squares
• FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS
• A one-step crust and skeleton extraction algorithm
• Reconstructing curves with sharp corners