Curve Reconstruction from Noisy and Unordered Samples

Marek W. Rupniewski

2014

Abstract

An algorithm for the reconstruction of closed and open curves from clouds of their noisy and unordered samples is presented. Each curve is reconstructed as a polygonal path represented by its vertices, which are determined in an iterative process comprising evolutionary and decimation stages. The quality of the reconstruction is studied with respect to the local density of the samples and the standard deviation of the noise perturbing the samples. The algorithm is verified to work for arbitrary dimensions of ambient space.

References

  1. Althaus, E. and Mehlhorn, K. (2001). Traveling salesmanbased curve reconstruction in polynomial time. SIAM Journal on Computing, 31(1):27-66.
  2. Cheng, S.-W., Funke, S., Golin, M., Kumar, P., Poon, S.- H., and Ramos, E. (2005). Curve reconstruction from noisy samples. Computational Geometry, 31(12):63 - 100.
  3. Cohen, E. and O'Dell, C. (1989). A data dependent parametrization for spline approximation. Mathematical Methods in Computer Aided Geometric Design, pages 155-166.
  4. Dey, T., Mehlhorn, K., and Ramos, E. (2000). Curve reconstruction: Connecting dots with good reason. Computational Geometry: Theory and Applications, 15(4):229-244.
  5. Fang, L. and Gossard, D. C. (1995). Multidimensional curve fitting to unorganized data points by nonlinear minimization. Computer-Aided Design, 27(1):48 - 58.
  6. Fritsch, F. and Carlson, R. (1980). Monotone piecewise cubic interpolation. SIAM J. Numer. Anal., 17(2):238- 246.
  7. Gold, C. and Snoeyink, J. (2001). A one-step crust and skeleton extraction algorithm. Algorithmica (New York), 30(2):144-163.
  8. Goshtasby, A. (1995). Geometric modelling using rational gaussian curves and surfaces. Computer-Aided Design, 27(5):363 - 375.
  9. Goshtasby, A. (2000). Grouping and parameterizing irregularly spaced points for curve fitting. ACM Transactions on Graphics, 19(3):185-203.
  10. Hastie, T. and Stuetzle, W. (1989). Principal curves. Journal of the American Statistical Association, 84(406):502- 516.
  11. Hölzle, G. (1983). Knot placement for piecewise polynomial approximation of curves. Computer-Aided Design, 15(5):295-296.
  12. Curve reconstruction from unorgaComputer Aided Geometric Design, Levin, D. (1998). The approximation power of moving least-squares. Mathematics of Computation, 67(224):1517-1531.
  13. Pottmann, H. and Randrup, T. (1998). Rotational and helical surface approximation for reverse engineering. Computing (Vienna/New York), 60(4):307-322.
  14. Ruiz, O. E., Cortés, C., Aristizábal, M., Acosta, D. A., and Vanegas, C. A. (2013). Parametric curve reconstruction from point clouds using minimization techniques. In GRAPP/IVAPP, pages 35-48.
Download


Paper Citation


in Harvard Style

W. Rupniewski M. (2014). Curve Reconstruction from Noisy and Unordered Samples . In Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-018-5, pages 183-188. DOI: 10.5220/0004814801830188


in Bibtex Style

@conference{icpram14,
author={Marek W. Rupniewski},
title={Curve Reconstruction from Noisy and Unordered Samples},
booktitle={Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2014},
pages={183-188},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004814801830188},
isbn={978-989-758-018-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - Curve Reconstruction from Noisy and Unordered Samples
SN - 978-989-758-018-5
AU - W. Rupniewski M.
PY - 2014
SP - 183
EP - 188
DO - 10.5220/0004814801830188