Skip to main content
Log in

Analysis of Curve Reconstruction by Meshless Parameterization

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

This paper proposes and analyzes a method called meshless parameterization for reconstructing curves from unordered point samples. The method solves a linear system of equations based on convex combinations so as to map the sampled points into corresponding parameter values, whose natural ordering provides the ordering of the points. Using the theory of M-matrices, we derive natural conditions on the point sample which guarantee the correct ordering. A sufficient condition is that the underlying curve be tangent-continuous and free of self-intersections and that the sample is dense enough.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. Amenta, M. Bern and D. Eppstein, The crust and the beta-skeleton: Combinatorial curve reconstruction, Graphical Models Image Process. 60 (1998) 125–135.

    Google Scholar 

  2. N. Amenta, M. Bern and M. Kamvysselis, A new Voronoi-based surface reconstruction algorithm, in: Computer Graphics, Proceedings ACM Siggraph 98 (1998) pp. 415–421.

  3. J.-D. Boissonnat, Geometric structures for three-dimensional shape representation, ACM Trans. Graphics 3(4) (1984) 266–286.

    Google Scholar 

  4. T.K. Dey and P. Kumar, A simple provable algorithm for curve reconstruction, in: Proc. of the 10th ACM–SIAM Symposium on Discrete Algorithms (1999) pp. 893–894.

  5. L.H. de Figueiredo and J. de Miranda Gomes, Computational morphology of curves, Visual Computer 11 (1995) 105–112.

    Google Scholar 

  6. M.S. Floater, Meshless parameterization and B-spline surface approximation, in: The Mathematics of Surfaces IX, eds. R. Cipolla and R. Martin (Springer, Berlin, 2000) pp. 1–18.

    Google Scholar 

  7. M.S. Floater and M. Reimers, Meshless parameterization and surface reconstruction, Comput. Aided Geom. Design 18 (2001) 77–92.

    Google Scholar 

  8. J. Giesen, Curve reconstruction, the traveling salesman problem, and Menger's theorem on length, Discrete Comput. Geom. 24 (2000) 577–603.

    Google Scholar 

  9. R. Schaback, Remarks on meshless local construction of surfaces, in: The Mathematics of Surfaces, Vol. IX, eds. R. Cipolla and R. Martin (Springer, Berlin, 2000) pp. 34–58.

    Google Scholar 

  10. R.S. Varga, Matrix Iterative Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1962).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Floater, M.S. Analysis of Curve Reconstruction by Meshless Parameterization. Numerical Algorithms 32, 87–98 (2003). https://doi.org/10.1023/A:1022218825389

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022218825389

Navigation