WIT Press


An Optimal Parallel Algorithm For Visualisation Of Solid Models

Price

Free (open access)

Paper DOI

10.2495/ASE930141

Volume

3

Pages

12

Published

1993

Size

1,093 kb

Author(s)

F. Devai

Abstract

An optimal parallel algorithm for visualisation of solid models F. Devai Department of Applied Computing, University of Ulster, Magee College, Northland Road, 7JI, ABSTRACT There is evidence provided by psychology research that the human visual system recognises solids by extracting edges in an image. Computer-aided geometric design systems provide hidden-line images as a standard visualisation facility, and the response time is crucial from the point of view of the usability of the system. This paper proposes a parallel algorithm for computing the union of N intervals represented by 2N real numbers as the endpoints of the intervals. The proposed algorithm takes O(logjV) time with N processors. The product of time and processor number is equal to the sequential complexity of the problem, therefore the algorithm achieves a perfect speedup. The parallel interval-union algorithm is used to develop an algorithm for hidden-line elimination that takes O(logAf) t

Keywords