A fast recursive parallel algorithm for triangulation of unordered DTM's

Abstract

Advances in computer technology and operating systems have brought us into an age where multiple processor machines are becoming increasingly important for the timely solution of complex, numerically intensive applications. The decomposition of a digital terrain model (DTM) into mutually exclusive data sets lends itself readily to parallel processing techniques. The use of a modern, high level language with the ability to support recursion and dynamic memory allocation allows an efficient and succinct implementation of a generalised triangulation algorithm.