Tight numerical bounds for digital terrain modeling by interpolatory subdivision schemes
DOI10.1016/J.MATCOM.2010.12.010zbMATH Open1221.65069OpenAlexW1970166724MaRDI QIDQ554569FDOQ554569
María Moncayo, J. F. Reinoso, Sergio Amat
Publication date: 4 August 2011
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2010.12.010
Recommendations
cartographyerror boundsnumerical resultsconvolutioncontrol polygoninterpolatory subdivision schemecontinuous surfaces
Geodesy, mapping problems (86A30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Title not available (Why is that?)
- Stationary subdivision
- Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon
- Title not available (Why is that?)
- A 4-point interpolatory subdivision scheme for curve design
- \(l^\infty \)-stability for linear multiresolution algorithms: A new explicit approach. I: The basic rules and the Daubechies case
- Exact error bounds for the reconstruction processes using interpolating wavelets
- Estimating error bounds for binary subdivision curves/surfaces
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- Parallelizing drainage network algorithm using free software: octave as a solution
- Title not available (Why is that?)
- Computing and Combinatorics
- Title not available (Why is that?)
- 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)
