2015
DOI: 10.1016/j.cagd.2015.06.002
|View full text |Cite
|
Sign up to set email alerts
|

A hierarchical construction of LR meshes in 2D

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
52
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
4

Relationship

3
7

Authors

Journals

citations
Cited by 27 publications
(52 citation statements)
references
References 16 publications
0
52
0
Order By: Relevance
“…In result, the CBCT approach was compared with 2D mesh topology and CBCT to provide better results in terms of end-to-end latency, network latency, packet latency, sink bandwidth, loss probability, link utilization and energy consumption of a topology. Similarly, the role of LR meshes in 2D was discussed in (Bressan et al, 2015). It shows a construction of LR-spaces whose bases are composed of locally linearly independent B-splines which also form a partition of unity.…”
Section: Two Dimensional (2d) Meshmentioning
confidence: 99%
“…In result, the CBCT approach was compared with 2D mesh topology and CBCT to provide better results in terms of end-to-end latency, network latency, packet latency, sink bandwidth, loss probability, link utilization and energy consumption of a topology. Similarly, the role of LR meshes in 2D was discussed in (Bressan et al, 2015). It shows a construction of LR-spaces whose bases are composed of locally linearly independent B-splines which also form a partition of unity.…”
Section: Two Dimensional (2d) Meshmentioning
confidence: 99%
“…In this section we show that hierarchical B-splines and multipatch domains fit into the localized sum factorization framework presented in this paper. Other generating systems without global tensor-product structure (like hierarchical LR splines [6]) could be analyzed in similar ways. The same holds if adaptivity and multipatch discretizations are combined.…”
Section: Localized Sum Factorization For Some Non-tensor-product Basesmentioning
confidence: 99%
“…To derive the upper bound, we need to transform (7) by subtracting a(v, η) from left-(LHS) and right-hand side (RHS) and by setting η = e. Thus, one obtains the error identity…”
Section: Functional Approach To the Error Controlmentioning
confidence: 99%