Developing parallel procedures for line simplification

1 September 1996

journal article
research article
Published by Taylor & Francis in International Journal of Geographical Information Science

Vol. 10 (6) , 699-712
https://doi.org/10.1080/02693799608902105

Abstract

This paper explores parallel programming issues that are relevant to the efficient implementation of spatial data handling procedures on current parallel computers through sample implementations of the Douglas line simplification procedure. Using source code-equivalent implementations of the Douglas procedure, this paper analyses the performance characteristics of two parallel implementations, compares their performance characteristics to those of a sequential implementation, and identifies critical components of the parallel implementations that enhance or inhibit their overall performance values. The results of this work show that the selection of appropriate interprocessor communication and load balancing strategies are crucial to obtaining large speedup values over comparable sequential implementations.

Keywords

This publication has 7 references indexed in Scilit:

The Design and Analysis of Parallel Algorithms
Published by Oxford University Press (OUP) ,1993
Automated Feature and Name Placement on Parallel Computers
Cartography and Geographic Information Systems, 1993
Implementing an intervisibility analysis model on a parallel computing system
Computers & Geosciences, 1992
A parallel implementation of the douglas-peucker line simplification algorithm
Software: Practice and Experience, 1991
Image Processing with the Staran Parallel Computer
Computer, 1977
Detection of Surface-Specific Points by Local Parallel Processing of Discrete Terrain Elevation Data
Computer Graphics and Image Processing, 1975
ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE
Cartographica: The International Journal for Geographic Information and Geovisualization, 1973