Two algorithms for approximation in highly complicated planar domains

MaRDI QIDQ3447129zbMATH OpenFDO

Authors Roman Kazinnik, Nira Dyn

Publication date 28 June 2007

zbMATH Keywords

adaptive methodapproximation in complicated planar domainsimage approximationimage compressionimage partitionimage segmentationmeasure of domain singularitysmall encoding budget

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Algorithms for nonlinear piecewise polynomial approximation: Theoretical aspects
• Computation of generalized convex approximations of planar geometric objects
• scientific article; zbMATH DE number 1225871
• Data compression with \(\Sigma\Pi\)-approximations based on splines
• An Algorithm for Piecewise Linear Approximation of Implicitly Defined Two-Dimensional Surfaces

Cited in

(1)

• An in-place algorithm for Klee's measure problem in two dimensions

This page was built for publication: Two algorithms for approximation in highly complicated planar domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3447129)