Loading…

Full-LSPIA: A Least-Squares Progressive-Iterative Approximation Method with Optimization of Weights and Knots for NURBS Curves and Surfaces

The Least-Squares Progressive-Iterative Approximation (LSPIA) method offers a powerful and intuitive approach for data fitting. Non-Uniform Rational B-splines (NURBS) are a popular choice for approximation functions in data fitting, due to their robust capabilities in shape representation. However,...

Full description

Saved in:
Bibliographic Details
Published in:Computer aided design 2024-04, Vol.169, p.103673, Article 103673
Main Authors: Lan, Lin, Ji, Ye, Wang, Meng-Yun, Zhu, Chun-Gang
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3
cites cdi_FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3
container_end_page
container_issue
container_start_page 103673
container_title Computer aided design
container_volume 169
creator Lan, Lin
Ji, Ye
Wang, Meng-Yun
Zhu, Chun-Gang
description The Least-Squares Progressive-Iterative Approximation (LSPIA) method offers a powerful and intuitive approach for data fitting. Non-Uniform Rational B-splines (NURBS) are a popular choice for approximation functions in data fitting, due to their robust capabilities in shape representation. However, a restriction of the traditional LSPIA application to NURBS is that it only iteratively adjusts control points to approximate the provided data, with weights and knots remaining static. To enhance fitting precision and overcome this constraint, we present Full-LSPIA, an innovative LSPIA method that jointly optimizes weights and knots alongside control points adjustments for superior NURBS curves and surfaces creation. We achieve this by constructing an objective function that incorporates control points, weights, and knots as variables, and solving the resultant optimization problem. Specifically, control points are adjusted using LSPIA, while weights and knots are optimized through the LBFGS method based on the analytical gradients of the objective function with respect to weights and knots. Additionally, we present a knot removal strategy known as Decremental Full-LSPIA. This strategy reduces the number of knots within a specified error tolerance, and determines optimal knot locations. The proposed Full-LSPIA and Decremental Full-LSPIA maximize the strengths of LSPIA, with numerical examples further highlighting the superior performance and effectiveness of these methods. Compared to the classical LSPIA, Full-LSPIA offers greater fitting accuracy for NURBS curves and surfaces while maintaining the same number of control points, and automatically determines suitable weights and knots. Moreover, Decremental Full-LSPIA yields fitting results with fewer knots while maintaining the same error tolerance. •We propose Full-LSPIA, a flexible and automatic fitting framework for LSPIA.•We develop analytical gradient formulations for the weights and knots of NURBS.•Full-LSPIA enhances the precision in NURBS approximation maintaining fixed DOFs.•Decremental Full-LSPIA yields lightweight NURBS curves with given error tolerance.
doi_str_mv 10.1016/j.cad.2023.103673
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_cad_2023_103673</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0010448523002051</els_id><sourcerecordid>S0010448523002051</sourcerecordid><originalsourceid>FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3</originalsourceid><addsrcrecordid>eNp9kE1OwzAUhC0EEqVwAHa-QIodJ3YMq1JRqChQURBLK3VeqKtSF9spP1fg0hjCikVXb0aj70kzCB1T0qOE8pNFT5dVLyUpi55xwXZQhxZCJikv8l3UIYSSJMuKfB8deL8ghKSUyQ76GjbLZTKeTkb9U9zHYyh9SKavTenA44mzz_F6s4FkFMCVISrcX6-dfTcv0dkVvoEwtxV-M2GO79bBvJjPNrA1fgLzPA8el6sKX69sVLV1-Pbx_nyKB43bQBtNG1eXGvwh2qvLpYejv9tFj8OLh8FVMr67HA3640SnUoQkF1xmLEsFcNBFWs94JaSuBBU0L-hM5DOoc6CpyIpMcsFrIRnXkslCaEZlxbqItn-1s947qNXaxTruQ1GiftZUCxXXVD9rqnbNyIh_jDbht2hwpVluJc9aEmKljQGnvDaw0lAZBzqoypot9DcDRI98</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Full-LSPIA: A Least-Squares Progressive-Iterative Approximation Method with Optimization of Weights and Knots for NURBS Curves and Surfaces</title><source>Elsevier</source><creator>Lan, Lin ; Ji, Ye ; Wang, Meng-Yun ; Zhu, Chun-Gang</creator><creatorcontrib>Lan, Lin ; Ji, Ye ; Wang, Meng-Yun ; Zhu, Chun-Gang</creatorcontrib><description>The Least-Squares Progressive-Iterative Approximation (LSPIA) method offers a powerful and intuitive approach for data fitting. Non-Uniform Rational B-splines (NURBS) are a popular choice for approximation functions in data fitting, due to their robust capabilities in shape representation. However, a restriction of the traditional LSPIA application to NURBS is that it only iteratively adjusts control points to approximate the provided data, with weights and knots remaining static. To enhance fitting precision and overcome this constraint, we present Full-LSPIA, an innovative LSPIA method that jointly optimizes weights and knots alongside control points adjustments for superior NURBS curves and surfaces creation. We achieve this by constructing an objective function that incorporates control points, weights, and knots as variables, and solving the resultant optimization problem. Specifically, control points are adjusted using LSPIA, while weights and knots are optimized through the LBFGS method based on the analytical gradients of the objective function with respect to weights and knots. Additionally, we present a knot removal strategy known as Decremental Full-LSPIA. This strategy reduces the number of knots within a specified error tolerance, and determines optimal knot locations. The proposed Full-LSPIA and Decremental Full-LSPIA maximize the strengths of LSPIA, with numerical examples further highlighting the superior performance and effectiveness of these methods. Compared to the classical LSPIA, Full-LSPIA offers greater fitting accuracy for NURBS curves and surfaces while maintaining the same number of control points, and automatically determines suitable weights and knots. Moreover, Decremental Full-LSPIA yields fitting results with fewer knots while maintaining the same error tolerance. •We propose Full-LSPIA, a flexible and automatic fitting framework for LSPIA.•We develop analytical gradient formulations for the weights and knots of NURBS.•Full-LSPIA enhances the precision in NURBS approximation maintaining fixed DOFs.•Decremental Full-LSPIA yields lightweight NURBS curves with given error tolerance.</description><identifier>ISSN: 0010-4485</identifier><identifier>EISSN: 1879-2685</identifier><identifier>DOI: 10.1016/j.cad.2023.103673</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Analytic gradient ; Curve and surface fitting ; Knot removal ; LSPIA ; NURBS</subject><ispartof>Computer aided design, 2024-04, Vol.169, p.103673, Article 103673</ispartof><rights>2024 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3</citedby><cites>FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3</cites><orcidid>0000-0002-0769-0812</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Lan, Lin</creatorcontrib><creatorcontrib>Ji, Ye</creatorcontrib><creatorcontrib>Wang, Meng-Yun</creatorcontrib><creatorcontrib>Zhu, Chun-Gang</creatorcontrib><title>Full-LSPIA: A Least-Squares Progressive-Iterative Approximation Method with Optimization of Weights and Knots for NURBS Curves and Surfaces</title><title>Computer aided design</title><description>The Least-Squares Progressive-Iterative Approximation (LSPIA) method offers a powerful and intuitive approach for data fitting. Non-Uniform Rational B-splines (NURBS) are a popular choice for approximation functions in data fitting, due to their robust capabilities in shape representation. However, a restriction of the traditional LSPIA application to NURBS is that it only iteratively adjusts control points to approximate the provided data, with weights and knots remaining static. To enhance fitting precision and overcome this constraint, we present Full-LSPIA, an innovative LSPIA method that jointly optimizes weights and knots alongside control points adjustments for superior NURBS curves and surfaces creation. We achieve this by constructing an objective function that incorporates control points, weights, and knots as variables, and solving the resultant optimization problem. Specifically, control points are adjusted using LSPIA, while weights and knots are optimized through the LBFGS method based on the analytical gradients of the objective function with respect to weights and knots. Additionally, we present a knot removal strategy known as Decremental Full-LSPIA. This strategy reduces the number of knots within a specified error tolerance, and determines optimal knot locations. The proposed Full-LSPIA and Decremental Full-LSPIA maximize the strengths of LSPIA, with numerical examples further highlighting the superior performance and effectiveness of these methods. Compared to the classical LSPIA, Full-LSPIA offers greater fitting accuracy for NURBS curves and surfaces while maintaining the same number of control points, and automatically determines suitable weights and knots. Moreover, Decremental Full-LSPIA yields fitting results with fewer knots while maintaining the same error tolerance. •We propose Full-LSPIA, a flexible and automatic fitting framework for LSPIA.•We develop analytical gradient formulations for the weights and knots of NURBS.•Full-LSPIA enhances the precision in NURBS approximation maintaining fixed DOFs.•Decremental Full-LSPIA yields lightweight NURBS curves with given error tolerance.</description><subject>Analytic gradient</subject><subject>Curve and surface fitting</subject><subject>Knot removal</subject><subject>LSPIA</subject><subject>NURBS</subject><issn>0010-4485</issn><issn>1879-2685</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE1OwzAUhC0EEqVwAHa-QIodJ3YMq1JRqChQURBLK3VeqKtSF9spP1fg0hjCikVXb0aj70kzCB1T0qOE8pNFT5dVLyUpi55xwXZQhxZCJikv8l3UIYSSJMuKfB8deL8ghKSUyQ76GjbLZTKeTkb9U9zHYyh9SKavTenA44mzz_F6s4FkFMCVISrcX6-dfTcv0dkVvoEwtxV-M2GO79bBvJjPNrA1fgLzPA8el6sKX69sVLV1-Pbx_nyKB43bQBtNG1eXGvwh2qvLpYejv9tFj8OLh8FVMr67HA3640SnUoQkF1xmLEsFcNBFWs94JaSuBBU0L-hM5DOoc6CpyIpMcsFrIRnXkslCaEZlxbqItn-1s947qNXaxTruQ1GiftZUCxXXVD9rqnbNyIh_jDbht2hwpVluJc9aEmKljQGnvDaw0lAZBzqoypot9DcDRI98</recordid><startdate>202404</startdate><enddate>202404</enddate><creator>Lan, Lin</creator><creator>Ji, Ye</creator><creator>Wang, Meng-Yun</creator><creator>Zhu, Chun-Gang</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-0769-0812</orcidid></search><sort><creationdate>202404</creationdate><title>Full-LSPIA: A Least-Squares Progressive-Iterative Approximation Method with Optimization of Weights and Knots for NURBS Curves and Surfaces</title><author>Lan, Lin ; Ji, Ye ; Wang, Meng-Yun ; Zhu, Chun-Gang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Analytic gradient</topic><topic>Curve and surface fitting</topic><topic>Knot removal</topic><topic>LSPIA</topic><topic>NURBS</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lan, Lin</creatorcontrib><creatorcontrib>Ji, Ye</creatorcontrib><creatorcontrib>Wang, Meng-Yun</creatorcontrib><creatorcontrib>Zhu, Chun-Gang</creatorcontrib><collection>CrossRef</collection><jtitle>Computer aided design</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lan, Lin</au><au>Ji, Ye</au><au>Wang, Meng-Yun</au><au>Zhu, Chun-Gang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Full-LSPIA: A Least-Squares Progressive-Iterative Approximation Method with Optimization of Weights and Knots for NURBS Curves and Surfaces</atitle><jtitle>Computer aided design</jtitle><date>2024-04</date><risdate>2024</risdate><volume>169</volume><spage>103673</spage><pages>103673-</pages><artnum>103673</artnum><issn>0010-4485</issn><eissn>1879-2685</eissn><abstract>The Least-Squares Progressive-Iterative Approximation (LSPIA) method offers a powerful and intuitive approach for data fitting. Non-Uniform Rational B-splines (NURBS) are a popular choice for approximation functions in data fitting, due to their robust capabilities in shape representation. However, a restriction of the traditional LSPIA application to NURBS is that it only iteratively adjusts control points to approximate the provided data, with weights and knots remaining static. To enhance fitting precision and overcome this constraint, we present Full-LSPIA, an innovative LSPIA method that jointly optimizes weights and knots alongside control points adjustments for superior NURBS curves and surfaces creation. We achieve this by constructing an objective function that incorporates control points, weights, and knots as variables, and solving the resultant optimization problem. Specifically, control points are adjusted using LSPIA, while weights and knots are optimized through the LBFGS method based on the analytical gradients of the objective function with respect to weights and knots. Additionally, we present a knot removal strategy known as Decremental Full-LSPIA. This strategy reduces the number of knots within a specified error tolerance, and determines optimal knot locations. The proposed Full-LSPIA and Decremental Full-LSPIA maximize the strengths of LSPIA, with numerical examples further highlighting the superior performance and effectiveness of these methods. Compared to the classical LSPIA, Full-LSPIA offers greater fitting accuracy for NURBS curves and surfaces while maintaining the same number of control points, and automatically determines suitable weights and knots. Moreover, Decremental Full-LSPIA yields fitting results with fewer knots while maintaining the same error tolerance. •We propose Full-LSPIA, a flexible and automatic fitting framework for LSPIA.•We develop analytical gradient formulations for the weights and knots of NURBS.•Full-LSPIA enhances the precision in NURBS approximation maintaining fixed DOFs.•Decremental Full-LSPIA yields lightweight NURBS curves with given error tolerance.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.cad.2023.103673</doi><orcidid>https://orcid.org/0000-0002-0769-0812</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0010-4485
ispartof Computer aided design, 2024-04, Vol.169, p.103673, Article 103673
issn 0010-4485
1879-2685
language eng
recordid cdi_crossref_primary_10_1016_j_cad_2023_103673
source Elsevier
subjects Analytic gradient
Curve and surface fitting
Knot removal
LSPIA
NURBS
title Full-LSPIA: A Least-Squares Progressive-Iterative Approximation Method with Optimization of Weights and Knots for NURBS Curves and Surfaces
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T18%3A25%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Full-LSPIA:%20A%20Least-Squares%20Progressive-Iterative%20Approximation%20Method%20with%20Optimization%20of%20Weights%20and%20Knots%20for%20NURBS%20Curves%20and%20Surfaces&rft.jtitle=Computer%20aided%20design&rft.au=Lan,%20Lin&rft.date=2024-04&rft.volume=169&rft.spage=103673&rft.pages=103673-&rft.artnum=103673&rft.issn=0010-4485&rft.eissn=1879-2685&rft_id=info:doi/10.1016/j.cad.2023.103673&rft_dat=%3Celsevier_cross%3ES0010448523002051%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c297t-576943427e6ec82fb6d79cd7171581b75bef5e1274849676f7936c93987c319d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true