Abstract
An on-line method for piecewise linear approximation of open or closed space curves is described. The algorithm guarantees approximation within a deviation threshold and is offered as an efficient, on-line alternative to the split and merge approach. Other efficient methods operate only on planar curves, whereas the approach we offer is also appropriate for space curves. A simple function of chord and arc length is used to form the initial set of approximating points. Preliminary Gaussian smoothing, posterior merging and least squares fitting are optional and can be done depending on the application. The algorithm performance has been tested on a variety of planar curves and comparisons made with other piecewise linear curve approximation algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
