Parallel implementation of curve reconstruction from noisy samples

• Main Authors: Randrianarivony, Maharavo, Brunnett, Guido
• Other Authors: TU Chemnitz, SFB 393
• Format: Others
• Language: English
• Published: Universitätsbibliothek Chemnitz 2006
• Subjects: curve reconstruction; noisy samples; nonlinear optimization; ddc:510; B-Spline; Geometrie; Parallelverarbeitung
• Online Access: http://nbn-resolving.de/urn:nbn:de:swb:ch1-200600519; http://nbn-resolving.de/urn:nbn:de:swb:ch1-200600519; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/index.html; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/.htaccess; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/SFBcov.png; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/pdf.gif; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/pre.css; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/ps.gif; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/sfb02-15.pdf; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/data/sfb02-15.ps.gz; http://www.qucosa.de/fileadmin/data/qucosa/documents/5164/20060051.txt

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.