2016
DOI: 10.1137/15m1033459
|View full text |Cite
|
Sign up to set email alerts
|

$C^1$ Analysis of Hermite Subdivision Schemes on Manifolds

Abstract: We propose two adaptations of linear Hermite subdivisions schemes to operate on manifold-valued data based on a Log-exp approach and on projection, respectively. Furthermore, we introduce a new proximity condition, which bounds the difference between a linear Hermite subdivision scheme and its manifold-valued analogue. Verification of this condition gives the main result: The manifold-valued Hermite subdivision scheme constructed from a C 1-convergent linear scheme is also C 1 , if certain technical conditions… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
19
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 17 publications
(20 citation statements)
references
References 28 publications
1
19
0
Order By: Relevance
“…To conclude C 1 convergence of U from convergence of S A , it is required that condition (15) is fulfilled whenever In the following we prove that the proximity condition (15) holds between a linear operator S A and the T M-valued operator U constructed from S A (13), where M is a surface or matrix group.…”
Section: The Proximity Condition For Hermite Schemesmentioning
confidence: 99%
See 4 more Smart Citations
“…To conclude C 1 convergence of U from convergence of S A , it is required that condition (15) is fulfilled whenever In the following we prove that the proximity condition (15) holds between a linear operator S A and the T M-valued operator U constructed from S A (13), where M is a surface or matrix group.…”
Section: The Proximity Condition For Hermite Schemesmentioning
confidence: 99%
“…While ⊕ is always smooth and often globally defined (this is the case in both matrix groups and complete surfaces [11,16]), is in general only smooth in some neighborhood of p. Our results in Section 5 are based on [15], which only considers "dense enough" input data. We therefore assume that is always smooth.…”
Section: Unified Notationmentioning
confidence: 99%
See 3 more Smart Citations