Parallel terrain triangulation

Abstract
Digital Elevation Models are considered in relation to their use in a parallel computing environment. In particular, the problem of approximating terrain surface through a Triangulated Irregular Network (TIN) is analysed. A parallel algorithm is presented that builds a TIN based on Delaunay triangulation, by selecting a sparse subset of points from a dense regular grid of sampled data. An implementation of the algorithm on a CM-2 is described and experimental results are shown.