Parallel enclosing rectangle on SIMD machines

Chang-Sung Jeong, Jung Ju Choi, Der Tsai Lee

Research output: Contribution to journalArticle

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 1
Externally publishedYes



  • convex hull
  • Parallel algorithm
  • SIMD machines
  • smallest enclosing rectangle

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture
  • Computer Science Applications

Cite this

Jeong, C-S., Choi, J. J., & Lee, D. T. (1992). Parallel enclosing rectangle on SIMD machines. Parallel Computing, 18(2), 221-229.