Monotonicity Preserving Subdivision Schemes
β Scribed by I. Yadshalom
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 479 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0021-9045
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we discuss a class of subdivision schemes with a finite support suitable for curve design. We analyze the case where the masks of the scheme and the associated difference process are positive. We show that these schemes generate continuous functions of bounded variation, and that the monotonicity of the data is preserved. An estimate of the Lipschitz class of the generated functions is also obtained. For curves in (R^{d}) the control polygons generated by the scheme satisfy some variation diminishing properties, in particular, the arc-length is nonincreasing. We characterize a particular subclass of schemes having bell-shaped refinable functions. Known sufficient conditions for excluding self-intersections and critical points of (B)-spline curves and surfaces hold also for these schemes. 1993 Academic Press. Inc.
π SIMILAR VOLUMES
of all the available data. The weighted-ENO (WENO) schemes by Liu et al. [14] and Jiang and Shu [10] make A new class of high-order monotonicity-preserving schemes for the numerical solution of conservation laws is presented. The inter-better use of the available data by defining the interface face