scientific article; zbMATH DE number 1534281

MaRDI QIDQ4517090zbMATH OpenFDO

Authors Helmut Pottmann, R. Krasauskas, Bernd Hamann, Wolfgang Seibold, Kenneth I. Joy

Publication date 22 November 2000

Full work available at URL https://eudml.org/doc/233792, http://www.emis.de/journals/JGG/4.1/3.html

zbMATH Keywords

Cayley-Klein geometryconvex geometryerror boundpiecewise linear approximationpolygon meshesquadratic functiontriangulationVoronoi tessellation

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

The authors discuss piecewise linear approximation to an \(n\)-variate quadratic function. The approximation is linear on the simplices of a triangulation. The problem considered is the following. Given a quadratic polynomial, find the piecewise linear approximation such that the \(L^\infty\)-norm is below a certain tolerance and such that the number of simplices is as small as possible, i.e., the pieces where the approximant is part of a certain hyperplane are as large as possible. Hence, for a given approximation error bound, some optimal tessellation is to be found. Not anly triangulations but also non-simplicial cells (bi- or trivariate surface graphs) are considered. Although the general idea is presented for general \(n\), the details for definite, indefinite and semidefinite quadratic forms are ellaborated in detail for the case \(n=2\) only. For \(n=3\), the detailed analysis is much harder and only few results are given.

Recommendations

• scientific article; zbMATH DE number 3998420
• Optimal triangulation of saddle surfaces
• On convex quadratic approximation
• Error estimates for certain piecewise-polynomial approximations in a plane
• Approximation by sums of piecewise linear polynomials

Cited in

(15)

• Optimal triangulation of saddle surfaces
• Estimating shape parameters of piecewise linear-quadratic problems
• On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
• Approximation of piecewise linear function in the sense of K_p-integral norm induced by K-quasi-arithmetic operations
• scientific article; zbMATH DE number 3882973 (Why is no real title available?)
• Optimal anisotropic meshes for minimizing interpolation errors in L^p-norm
• Fitting piecewise linear continuous functions
• Are Bilinear Quadrilaterals Better Than Linear Triangles?
• scientific article; zbMATH DE number 3998420 (Why is no real title available?)
• scientific article; zbMATH DE number 897227 (Why is no real title available?)
• Approximation factors and subdivision's number of piecewise linear functions in low dimensional space
• Tessellation of Quadratic Elements
• An approximation algorithm for optimal piecewise linear interpolations of bounded variable products
• Continuous piecewise linear delta-approximations for bivariate and multivariate functions
• Exact asymptotics of the uniform error of interpolation by multilinear splines

This page was built for publication:

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