Piecewise optimal triangulation for the approximation of scattered data in the plane
From MaRDI portal
Publication:1583091
DOI10.1016/S0167-8396(00)00026-1zbMATH Open0948.68183MaRDI QIDQ1583091FDOQ1583091
Authors: J. C. Barnes, Martin Hering-Bertram, Bernd Hamann, Kenneth I. Joy, Helmut Pottmann
Publication date: 26 October 2000
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Recommendations
- Adaptive Approximation by Piecewise Linear Polynomials on Triangulations of Subsets of Scattered Data
- On scattered data representations using bivariate splines
- scientific article; zbMATH DE number 1967830
- Triangulation of scattered data in 3D space
- Swapping Edgesof Arbitrary Triangulations to Achieve the Optimal Order of Approximation
clusteringtriangulationapproximationquadratic polynomialsdata-dependent triangulationhierarchical approximation
Cited In (11)
- Optimal triangulation of saddle surfaces
- An acquisition and optimization algorithm for slicing data of scattered points
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adaptive Approximation by Piecewise Linear Polynomials on Triangulations of Subsets of Scattered Data
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Normalized implicit eigenvector least squares operators for noisy scattered data: Radial basis functions
- Exact asymptotics of the uniform error of interpolation by multilinear splines
- Data point selection for piecewise trilinear approximation
- Triangulation of scattered data in 3D space
- Lawson’s Triangulation is Nearly Optimal for Controlling Error Bounds
This page was built for publication: Piecewise optimal triangulation for the approximation of scattered data in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583091)