Computational geometry: an introduction
Computational geometry: an introduction
Knot removal for parametric B-spline curves and surfaces
Computer Aided Geometric Design
Optimal triangular mesh generation by coordinate transformation
SIAM Journal on Scientific and Statistical Computing
Least squares fitting by linear splines on data dependent triangulations
Curves and surfaces
Long and thin triangles can be good for linear interpolation
SIAM Journal on Numerical Analysis
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Numerical Recipes in C: The Art of Scientific Computing
Numerical Recipes in C: The Art of Scientific Computing
Photorealistic Terrain Imaging Flight Simulation
IEEE Computer Graphics and Applications
Efficient co-triangulation of large data sets
Proceedings of the conference on Visualization '98
An efficient algorithm for terrain simplification
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We consider the problem of approximating a smooth surface f(x,y), based on n scattered samples {(xi, yi, zi)ni=1} where the sample values {zi} are contaminated with noise: zi = f(xi, yi) + εi. We present an algorithm that generates a PLS (Piecewise Linear Surface) f1, defined on a triangulation of the sample locations V = {(xi, yi)ni=1}, approximating f well. Constructing the PLS involves specifying both the triangulation of V and the values of f1 at the points of V. We demonstrate that even when the sampling process is not noisy, a better approximation for f is obtained using our algorithm, compared to existing methods. This algorithm is useful for DTM (Digital Terrain Map) manipulation by polygon-based graphics engines for visualization applications.