This paper is concerned with approximating noisy
samples by non-uniform rational B-spline curves
with special emphasis on free knots. We show how to
set up the problem such that nonlinear optimization
methods can be applied efficiently. This involves
the introduction of penalizing terms in order to
avoid undesired knot positions. We report on our
implementation of the nonlinear optimization and we
show a way to implement the program in parallel.
Parallel performance results are described. Our
experiments show that our program has a linear
speedup and an efficiency value close to unity.
Runtime results on a parallel computer are
displayed.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:ch1-200600519 |
| Date | 06 April 2006 |
| Creators | Randrianarivony, Maharavo, Brunnett, Guido |
| Contributors | TU Chemnitz, SFB 393 |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | text/html, text/plain, image/png, image/gif, text/plain, image/gif, application/pdf, application/x-gzip, text/plain, application/zip |
| Source | Preprintreihe des Chemnitzer SFB 393, 02-15 |
Page generated in 0.0024 seconds