ePrints

A Parallel Thinning Algorithm with Fine Grain Subtasking

Lookup NU author(s): Dr Christopher Holt

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

A one-pass iterative parallel thinning algorithm has been designed to reduce a two-dimensional pattern of strokes to its skeleton by removing layers of edge element until stroke has unitary thickness. An edge test computation is simulataneously carried out for each element in the two-dimensional pattern by inspecting the values of its neighbours. However, there is a degree of duplication among edge computations for elements with common neighbours. A modified algorithm described in this paper which avoids duplication at the cost of extra communication. The speed of the modified algorithm compared to the original algorithm is1. (i) approximately 45% better on the ICL DAP;2. (ii) approximately 30% better on the CRAY X-MP.

Publication metadata

Author(s): Holt CM, Stewart A

Publication type: Article

Publication status: Published

Journal: Parallel Computing

Year: 1989

Volume: 10

Issue: 3

Pages: 329-334

ISSN (print): 0167-8191

ISSN (electronic): 1872-7336

Publisher: Elsevier BV

URL: http://dx.doi.org/10.1016/0167-8191(89)90105-1

DOI: 10.1016/0167-8191(89)90105-1

Altmetrics

Share