Nonuniform corner cutting. (English) Zbl 0900.68411
Summary: The convergence of a nonuniform corner cutting process is investigated. It is shown that the limit curve will be differentiable provided the proportions of the corner cuts are kept within appropriate constraints.
MSC:
| 68U05 | Computer graphics; computational geometry (digital and algorithmic aspects) |
| 68U10 | Computing methodologies for image processing |
References:
| [1] | de Boor, C., Cutting corners always works, Computer Aided Geometric Design, 4, 125-131 (1987) · Zbl 0637.41014 |
| [2] | Dyn, N.; Gregory, J. A.; Levin, D., Analysis of uniform binary subdivision schemes for curve design (1988), Preprint (appeared in Constructive Approximation, 1990) |
| [3] | Micchelli, C. A.; Prautzsch, H., Uniform refinement of curves (1987), Preprint (appeared in Linear Algebra and Its Applications 115/115 (1989) 841-870) · Zbl 0668.65011 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
