![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
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.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
