Loading…

Non-uniform interpolatory subdivision schemes with improved smoothness

Subdivision schemes are used to generate smooth curves or surfaces by iteratively refining an initial control polygon or mesh. We focus on univariate, linear, binary subdivision schemes, where the vertices of the refined polygon are computed as linear combinations of the current neighbouring vertice...

Full description

Saved in:
Bibliographic Details
Published in:Computer aided geometric design 2022-03, Vol.94, p.102083, Article 102083
Main Authors: Dyn, Nira, Hormann, Kai, Mancinelli, Claudio
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-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993
cites cdi_FETCH-LOGICAL-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993
container_end_page
container_issue
container_start_page 102083
container_title Computer aided geometric design
container_volume 94
creator Dyn, Nira
Hormann, Kai
Mancinelli, Claudio
description Subdivision schemes are used to generate smooth curves or surfaces by iteratively refining an initial control polygon or mesh. We focus on univariate, linear, binary subdivision schemes, where the vertices of the refined polygon are computed as linear combinations of the current neighbouring vertices. In the classical stationary setting, there are just two such subdivision rules, which are used throughout all subdivision steps to construct the new vertices with even and odd indices, respectively. These schemes are well understood and many tools have been developed for deriving their properties, including the smoothness of the limit curves. For non-stationary schemes, the subdivision rules are not fixed and can be different in each subdivision step. Non-uniform schemes are even more general, as they allow the subdivision rules to be different for every new vertex that is generated by the scheme. The properties of non-stationary and non-uniform schemes are usually derived by relating the scheme to a corresponding stationary scheme and then exploiting the fact that the properties of the stationary scheme carry over under certain proximity conditions. In particular, this approach can be used to show that the limit curves of a non-stationary or non-uniform scheme are as smooth as those of a corresponding stationary scheme. In this paper we show that non-uniform subdivision schemes have the potential to generate limit curves that are smoother than those of stationary schemes with the same support size of the subdivision rule. For that, we derive interpolatory 2-point and 4-point schemes that generate C1 and C2 limit curves, respectively. These values of smoothness exceed the smoothness of classical interpolating schemes with the same support size by one.
doi_str_mv 10.1016/j.cagd.2022.102083
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_cagd_2022_102083</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S016783962200019X</els_id><sourcerecordid>S016783962200019X</sourcerecordid><originalsourceid>FETCH-LOGICAL-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993</originalsourceid><addsrcrecordid>eNp9kM1KAzEUhYMoWKsv4GpeYGp-mj9wI8WqUHSj6zCT3NiUzqTkTit9e6fUtasLh_sdDh8h94zOGGXqYTPzzXeYccr5GHBqxAWZMKNtzYXgl2QyPunaCKuuyQ3ihlLKmVUTsnzPfb3vU8ylq1I_QNnlbTPkcqxw34Z0SJhyX6FfQwdY_aRhXaVuV_IBQoVdzsO6B8RbchWbLcLd352Sr-Xz5-K1Xn28vC2eVrXnej7UjaKtVMIbZZsgrW2jUVoEAM3mknoZrNZGRtYKqznVMs4pjVxKE3T03FoxJfzc60tGLBDdrqSuKUfHqDuZcBt3MuFOJtzZxAg9niEYlx0SFIc-Qe8hpAJ-cCGn__BfI_dnxg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Non-uniform interpolatory subdivision schemes with improved smoothness</title><source>Elsevier</source><source>Backfile Package - Mathematics</source><creator>Dyn, Nira ; Hormann, Kai ; Mancinelli, Claudio</creator><creatorcontrib>Dyn, Nira ; Hormann, Kai ; Mancinelli, Claudio</creatorcontrib><description>Subdivision schemes are used to generate smooth curves or surfaces by iteratively refining an initial control polygon or mesh. We focus on univariate, linear, binary subdivision schemes, where the vertices of the refined polygon are computed as linear combinations of the current neighbouring vertices. In the classical stationary setting, there are just two such subdivision rules, which are used throughout all subdivision steps to construct the new vertices with even and odd indices, respectively. These schemes are well understood and many tools have been developed for deriving their properties, including the smoothness of the limit curves. For non-stationary schemes, the subdivision rules are not fixed and can be different in each subdivision step. Non-uniform schemes are even more general, as they allow the subdivision rules to be different for every new vertex that is generated by the scheme. The properties of non-stationary and non-uniform schemes are usually derived by relating the scheme to a corresponding stationary scheme and then exploiting the fact that the properties of the stationary scheme carry over under certain proximity conditions. In particular, this approach can be used to show that the limit curves of a non-stationary or non-uniform scheme are as smooth as those of a corresponding stationary scheme. In this paper we show that non-uniform subdivision schemes have the potential to generate limit curves that are smoother than those of stationary schemes with the same support size of the subdivision rule. For that, we derive interpolatory 2-point and 4-point schemes that generate C1 and C2 limit curves, respectively. These values of smoothness exceed the smoothness of classical interpolating schemes with the same support size by one.</description><identifier>ISSN: 0167-8396</identifier><identifier>EISSN: 1879-2332</identifier><identifier>DOI: 10.1016/j.cagd.2022.102083</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Non-uniform ; Smoothness ; Subdivision</subject><ispartof>Computer aided geometric design, 2022-03, Vol.94, p.102083, Article 102083</ispartof><rights>2022 The Author(s)</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993</citedby><cites>FETCH-LOGICAL-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993</cites><orcidid>0000-0001-6455-4246</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S016783962200019X$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,3562,27922,27923,46001</link.rule.ids></links><search><creatorcontrib>Dyn, Nira</creatorcontrib><creatorcontrib>Hormann, Kai</creatorcontrib><creatorcontrib>Mancinelli, Claudio</creatorcontrib><title>Non-uniform interpolatory subdivision schemes with improved smoothness</title><title>Computer aided geometric design</title><description>Subdivision schemes are used to generate smooth curves or surfaces by iteratively refining an initial control polygon or mesh. We focus on univariate, linear, binary subdivision schemes, where the vertices of the refined polygon are computed as linear combinations of the current neighbouring vertices. In the classical stationary setting, there are just two such subdivision rules, which are used throughout all subdivision steps to construct the new vertices with even and odd indices, respectively. These schemes are well understood and many tools have been developed for deriving their properties, including the smoothness of the limit curves. For non-stationary schemes, the subdivision rules are not fixed and can be different in each subdivision step. Non-uniform schemes are even more general, as they allow the subdivision rules to be different for every new vertex that is generated by the scheme. The properties of non-stationary and non-uniform schemes are usually derived by relating the scheme to a corresponding stationary scheme and then exploiting the fact that the properties of the stationary scheme carry over under certain proximity conditions. In particular, this approach can be used to show that the limit curves of a non-stationary or non-uniform scheme are as smooth as those of a corresponding stationary scheme. In this paper we show that non-uniform subdivision schemes have the potential to generate limit curves that are smoother than those of stationary schemes with the same support size of the subdivision rule. For that, we derive interpolatory 2-point and 4-point schemes that generate C1 and C2 limit curves, respectively. These values of smoothness exceed the smoothness of classical interpolating schemes with the same support size by one.</description><subject>Non-uniform</subject><subject>Smoothness</subject><subject>Subdivision</subject><issn>0167-8396</issn><issn>1879-2332</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kM1KAzEUhYMoWKsv4GpeYGp-mj9wI8WqUHSj6zCT3NiUzqTkTit9e6fUtasLh_sdDh8h94zOGGXqYTPzzXeYccr5GHBqxAWZMKNtzYXgl2QyPunaCKuuyQ3ihlLKmVUTsnzPfb3vU8ylq1I_QNnlbTPkcqxw34Z0SJhyX6FfQwdY_aRhXaVuV_IBQoVdzsO6B8RbchWbLcLd352Sr-Xz5-K1Xn28vC2eVrXnej7UjaKtVMIbZZsgrW2jUVoEAM3mknoZrNZGRtYKqznVMs4pjVxKE3T03FoxJfzc60tGLBDdrqSuKUfHqDuZcBt3MuFOJtzZxAg9niEYlx0SFIc-Qe8hpAJ-cCGn__BfI_dnxg</recordid><startdate>202203</startdate><enddate>202203</enddate><creator>Dyn, Nira</creator><creator>Hormann, Kai</creator><creator>Mancinelli, Claudio</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-6455-4246</orcidid></search><sort><creationdate>202203</creationdate><title>Non-uniform interpolatory subdivision schemes with improved smoothness</title><author>Dyn, Nira ; Hormann, Kai ; Mancinelli, Claudio</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Non-uniform</topic><topic>Smoothness</topic><topic>Subdivision</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dyn, Nira</creatorcontrib><creatorcontrib>Hormann, Kai</creatorcontrib><creatorcontrib>Mancinelli, Claudio</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><jtitle>Computer aided geometric design</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dyn, Nira</au><au>Hormann, Kai</au><au>Mancinelli, Claudio</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Non-uniform interpolatory subdivision schemes with improved smoothness</atitle><jtitle>Computer aided geometric design</jtitle><date>2022-03</date><risdate>2022</risdate><volume>94</volume><spage>102083</spage><pages>102083-</pages><artnum>102083</artnum><issn>0167-8396</issn><eissn>1879-2332</eissn><abstract>Subdivision schemes are used to generate smooth curves or surfaces by iteratively refining an initial control polygon or mesh. We focus on univariate, linear, binary subdivision schemes, where the vertices of the refined polygon are computed as linear combinations of the current neighbouring vertices. In the classical stationary setting, there are just two such subdivision rules, which are used throughout all subdivision steps to construct the new vertices with even and odd indices, respectively. These schemes are well understood and many tools have been developed for deriving their properties, including the smoothness of the limit curves. For non-stationary schemes, the subdivision rules are not fixed and can be different in each subdivision step. Non-uniform schemes are even more general, as they allow the subdivision rules to be different for every new vertex that is generated by the scheme. The properties of non-stationary and non-uniform schemes are usually derived by relating the scheme to a corresponding stationary scheme and then exploiting the fact that the properties of the stationary scheme carry over under certain proximity conditions. In particular, this approach can be used to show that the limit curves of a non-stationary or non-uniform scheme are as smooth as those of a corresponding stationary scheme. In this paper we show that non-uniform subdivision schemes have the potential to generate limit curves that are smoother than those of stationary schemes with the same support size of the subdivision rule. For that, we derive interpolatory 2-point and 4-point schemes that generate C1 and C2 limit curves, respectively. These values of smoothness exceed the smoothness of classical interpolating schemes with the same support size by one.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.cagd.2022.102083</doi><orcidid>https://orcid.org/0000-0001-6455-4246</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0167-8396
ispartof Computer aided geometric design, 2022-03, Vol.94, p.102083, Article 102083
issn 0167-8396
1879-2332
language eng
recordid cdi_crossref_primary_10_1016_j_cagd_2022_102083
source Elsevier; Backfile Package - Mathematics
subjects Non-uniform
Smoothness
Subdivision
title Non-uniform interpolatory subdivision schemes with improved smoothness
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T13%3A03%3A56IST&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=Non-uniform%20interpolatory%20subdivision%20schemes%20with%20improved%20smoothness&rft.jtitle=Computer%20aided%20geometric%20design&rft.au=Dyn,%20Nira&rft.date=2022-03&rft.volume=94&rft.spage=102083&rft.pages=102083-&rft.artnum=102083&rft.issn=0167-8396&rft.eissn=1879-2332&rft_id=info:doi/10.1016/j.cagd.2022.102083&rft_dat=%3Celsevier_cross%3ES016783962200019X%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c274t-a60b563c869ad599bf8673dee71450c5d97785f1b3972075f400f2558d7fc2993%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