Abstract
In this paper, we present a parallel algorithm for finding the smallest enclosing rectangle for a set of n points. The parallel algorithm can be generally implemented on mesh-connected and cube-connected SIMD computers with the time complexity O(√n) and O(log2 n) respectively.
Original language | English |
---|---|
Pages (from-to) | 221-229 |
Number of pages | 9 |
Journal | Parallel Computing |
Volume | 18 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1992 Feb |
Externally published | Yes |
Bibliographical note
Funding Information:* Research supported by KOSEF
Keywords
- Parallel algorithm
- SIMD machines
- convex hull
- smallest enclosing rectangle
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computer Graphics and Computer-Aided Design
- Artificial Intelligence