Parallel enclosing rectangle on SIMD machines

Chang Sung Jeong, Jung Ju Choi, Der Tsai Lee

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)221-229
Number of pages9
JournalParallel Computing
Issue number2
Publication statusPublished - 1992 Feb
Externally publishedYes

Bibliographical note

Funding Information:
* Research supported by KOSEF


  • 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


Dive into the research topics of 'Parallel enclosing rectangle on SIMD machines'. Together they form a unique fingerprint.

Cite this