2002
DOI: 10.1017/s0962492902000028
|View full text |Cite
|
Sign up to set email alerts
|

Subdivision schemes in geometric modelling

Abstract: Subdivision schemes are efficient computational methods for the design and representation of 3D surfaces of arbitrary topology. They are also a tool for the generation of refinable functions, which are instrumental in the construction of wavelets. This paper presents various flavours of subdivision, seasoned by the personal viewpoint of the authors, which is mainly concerned with geometric modelling. Our starting point is the general setting of scalar multivariate nonstationary schemes on regular grids. We als… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
200
0
1

Year Published

2003
2003
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 308 publications
(204 citation statements)
references
References 76 publications
3
200
0
1
Order By: Relevance
“…We start with recalling known facts for linear subdivision schemes [4,8]. Let the dyadic S be given by a locally supported mask a = (a k ) k鈭圸 of scalar coefficients, i.e., the action of S on a scalar sequence x = (x i ) i鈭圸 is given by…”
Section: Preliminary Facts and Main Resultsmentioning
confidence: 99%
“…We start with recalling known facts for linear subdivision schemes [4,8]. Let the dyadic S be given by a locally supported mask a = (a k ) k鈭圸 of scalar coefficients, i.e., the action of S on a scalar sequence x = (x i ) i鈭圸 is given by…”
Section: Preliminary Facts and Main Resultsmentioning
confidence: 99%
“…The remainder of this subsection is devoted to the verification of (20). There is a standard way of dealing with such recursive inequalities which has been developed for studying regularity of subdivision schemes and vector refinement equations (see, e.g., [5,11,12,20]). The basic ingredients are as follows.…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…The main new ingredient is a H 1+ Bernstein inequality for the IPOs which replaces the H 1 Bernstein estimates used previously, and allows to get an optimal upper spectral bound for the preconditioners under consideration. Verifying such Bernstein inequalities requires subtle techniques from the regularity theory of subdivision methods and refinable functions (for general expositions on these research areas, see [5,11,12,20]). …”
Section: Introductionmentioning
confidence: 99%
“…Two important areas where interpolatory subdivision schemes play a crucial role are Computer Aided Geometric Design (CAGD) and wavelets construction (see [11] and [19], respectively). In these fields a fundamental issue that recently emerged is concerned with the study of numerical algorithms for converting known approximating schemes into new interpolatory ones.…”
Section: Introductionmentioning
confidence: 99%