Piecewise-linear surface approximation from noisy scattered samples

Michael Margaliot, Craig Gotsman

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

We consider the problem of approximating a smooth surface f(x,y), based on n scattered samples {(xi, yi, zi)in = 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) f′, defined on a triangulation of the sample locations V = {(xi, yi)in=1}, approximating f well. Constructing the PLS involves specifying both the triangulation of V and the values of f′ 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.

Original languageEnglish (US)
Pages (from-to)61-68
Number of pages8
JournalProceedings Visualization
StatePublished - Dec 1 1994
Externally publishedYes
EventProceedings of the 1994 IEEE Visualization Conference - Washington, DC, USA
Duration: Oct 17 1994Oct 21 1994

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Piecewise-linear surface approximation from noisy scattered samples'. Together they form a unique fingerprint.

Cite this