Tight numerical bounds for digital terrain modeling by interpolatory subdivision schemes
From MaRDI portal
(Redirected from Publication:554569)
Recommendations
Cites work
- scientific article; zbMATH DE number 1803820 (Why is no real title available?)
- scientific article; zbMATH DE number 2130861 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- A 4-point interpolatory subdivision scheme for curve design
- Estimating error bounds for binary subdivision curves/surfaces
- Exact error bounds for the reconstruction processes using interpolating wavelets
- Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
- Stationary subdivision
- \(l^\infty \)-stability for linear multiresolution algorithms: A new explicit approach. I: The basic rules and the Daubechies case
Cited in
(6)- scientific article; zbMATH DE number 1754552 (Why is no real title available?)
- Parallelizing drainage network algorithm using free software: octave as a solution
- scientific article; zbMATH DE number 5525421 (Why is no real title available?)
- Computing and Combinatorics
- scientific article; zbMATH DE number 1688626 (Why is no real title available?)
- BOX-COUNTING DIMENSION RELATED TO THE BOUNDARY OF HEXAGONAL ARRAYS FOR AN EFFICIENT DIGITAL EARTH MODEL
This page was built for publication: Tight numerical bounds for digital terrain modeling by interpolatory subdivision schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554569)