Grouping and parameterizing irregularly spaced points for curve fitting

50Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

Given a large set of irregularly spaced points in the plane, an algorithm for partitioning the points into subsets and fitting a parametric curve to each subset is described. The points could be measurements from a physical phenomenon, and the objective in this process could be to find patterns among the points and describe the phenomenon analytically. The points could be measurements from a geometric model, and the objective could be to reconstruct the model by a combination of parametric curves. The algorithm proposed here can be used in various applications, especially where given points are dense and noisy. Examples demonstrating the behavior of the algorithm under noise and density of the points are presented and discussed.

Cite

CITATION STYLE

APA

Goshtasby, A. A. (2000). Grouping and parameterizing irregularly spaced points for curve fitting. ACM Transactions on Graphics, 19(3), 185–203. https://doi.org/10.1145/353981.353992

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free