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

Links

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

Published

Standard

A parallel implementation of the douglas‐peucker line simplification algorithm. / Vaughan, Jon; Whyatt, Duncan; Brookes, Graham.
In: Software: Practice and Experience, Vol. 21, No. 3, 01.03.1991, p. 331-336.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Vaughan, J, Whyatt, D & Brookes, G 1991, 'A parallel implementation of the douglas‐peucker line simplification algorithm', Software: Practice and Experience, vol. 21, no. 3, pp. 331-336. https://doi.org/10.1002/spe.4380210307

APA

Vaughan, J., Whyatt, D., & Brookes, G. (1991). A parallel implementation of the douglas‐peucker line simplification algorithm. Software: Practice and Experience, 21(3), 331-336. https://doi.org/10.1002/spe.4380210307

Vancouver

Vaughan J, Whyatt D, Brookes G. A parallel implementation of the douglas‐peucker line simplification algorithm. Software: Practice and Experience. 1991 Mar 1;21(3):331-336. doi: 10.1002/spe.4380210307

Author

Vaughan, Jon ; Whyatt, Duncan ; Brookes, Graham. / A parallel implementation of the douglas‐peucker line simplification algorithm. In: Software: Practice and Experience. 1991 ; Vol. 21, No. 3. pp. 331-336.

Bibtex

@article{8adc5883f46c4394a25ba37161b55d8a,
title = "A parallel implementation of the douglas‐peucker line simplification algorithm",
abstract = "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.",
keywords = "Line simplification, Parallel processing, Performance",
author = "Jon Vaughan and Duncan Whyatt and Graham Brookes",
year = "1991",
month = mar,
day = "1",
doi = "10.1002/spe.4380210307",
language = "English",
volume = "21",
pages = "331--336",
journal = "Software: Practice and Experience",
issn = "0038-0644",
publisher = "John Wiley and Sons Ltd",
number = "3",

}

RIS

TY - JOUR

T1 - A parallel implementation of the douglas‐peucker line simplification algorithm

AU - Vaughan, Jon

AU - Whyatt, Duncan

AU - Brookes, Graham

PY - 1991/3/1

Y1 - 1991/3/1

N2 - 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.

AB - 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.

KW - Line simplification

KW - Parallel processing

KW - Performance

U2 - 10.1002/spe.4380210307

DO - 10.1002/spe.4380210307

M3 - Journal article

AN - SCOPUS:0026120268

VL - 21

SP - 331

EP - 336

JO - Software: Practice and Experience

JF - Software: Practice and Experience

SN - 0038-0644

IS - 3

ER -