Home > Research > Publications & Outputs > A parallel implementation of the douglas‐peucke...


Text available via DOI:

View graph of relations

A parallel implementation of the douglas‐peucker line simplification algorithm

Research output: Contribution to Journal/MagazineJournal articlepeer-review

<mark>Journal publication date</mark>1/03/1991
<mark>Journal</mark>Software: Practice and Experience
Issue number3
Number of pages6
Pages (from-to)331-336
Publication StatusPublished
<mark>Original language</mark>English


As parallel machines become more widely available, many existing algorithms are being converted to take advantage of the improved speed offered by such computers. However, the method by which the algorithm is distributed is crucial towards obtaining the speed‐ups required for many real‐time tasks. This paper presents three parallel implementations of the Douglas—Peucker line simplification algorithm on a Sequent Symmetry computer and compares the performance of each with the original sequential algorithm.