Parallel enclosing rectangle on SIMD machines

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

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

Fingerprint

Parallel algorithms
Rectangle
Parallel Algorithms
Regular hexahedron
Time Complexity
Mesh

Keywords

  • 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.

Parallel enclosing rectangle on SIMD machines. / Jeong, Chang-Sung; Choi, Jung Ju; Lee, Der Tsai.

In: Parallel Computing, Vol. 18, No. 2, 01.02.1992, p. 221-229.

Research output: Contribution to journalArticle

Jeong, C-S, Choi, JJ & Lee, DT 1992, 'Parallel enclosing rectangle on SIMD machines', Parallel Computing, vol. 18, no. 2, pp. 221-229.
Jeong C-S, Choi JJ, Lee DT. Parallel enclosing rectangle on SIMD machines. Parallel Computing. 1992 Feb 1;18(2):221-229.
Jeong, Chang-Sung ; Choi, Jung Ju ; Lee, Der Tsai. / Parallel enclosing rectangle on SIMD machines. In: Parallel Computing. 1992 ; Vol. 18, No. 2. pp. 221-229.
@article{1b13c12ec3934e1aab06c7ed33cc2c12,
title = "Parallel enclosing rectangle on SIMD machines",
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.",
keywords = "convex hull, Parallel algorithm, SIMD machines, smallest enclosing rectangle",
author = "Chang-Sung Jeong and Choi, {Jung Ju} and Lee, {Der Tsai}",
year = "1992",
month = "2",
day = "1",
language = "English",
volume = "18",
pages = "221--229",
journal = "Parallel Computing",
issn = "0167-8191",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Parallel enclosing rectangle on SIMD machines

AU - Jeong, Chang-Sung

AU - Choi, Jung Ju

AU - Lee, Der Tsai

PY - 1992/2/1

Y1 - 1992/2/1

N2 - 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.

AB - 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.

KW - convex hull

KW - Parallel algorithm

KW - SIMD machines

KW - smallest enclosing rectangle

UR - http://www.scopus.com/inward/record.url?scp=44049120292&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44049120292&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:44049120292

VL - 18

SP - 221

EP - 229

JO - Parallel Computing

JF - Parallel Computing

SN - 0167-8191

IS - 2

ER -