Name
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 are 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. Algorithm performance has been tested on a variety of planar curves and comparisons made with other piecewise linear curve approximation algorithms. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/ICIP.1997.638603 | ICIP |
Keywords | Field | DocType |
Gaussian processes,curve fitting,least squares approximations,piecewise-linear techniques,smoothing methods,Gaussian smoothing,algorithm performance,arc length,chord,closed space curves,deviation threshold,least squares fitting,on-line method,open space curves,piecewise linear approximation,planar curves,posterior merging | Least squares,Applied mathematics,Family of curves,Curve fitting,Geometric design,Gaussian process,Artificial intelligence,Piecewise linear function,Approximation algorithm,Discrete mathematics,Pattern recognition,Arc length,Mathematics | Conference |
Volume | Citations | PageRank |
2 | 8 | 0.73 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Albert Horst | 1 | 8 | 1.07 |
| Beichl, Isabel | 2 | 63 | 22.58 |