Parallel enclosing rectangle on SIMD machines

Chang Sung Jeong; Jung Ju Choi; Der Tsai Lee

doi:10.1016/0167-8191(92)90081-H

Parallel enclosing rectangle on SIMD machines

Chang Sung Jeong^*
, Jung Ju Choi
, Der Tsai Lee

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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(log² n) respectively.

Original language	English
Pages (from-to)	221-229
Number of pages	9
Journal	Parallel Computing
Volume	18
Issue number	2
DOIs	https://doi.org/10.1016/0167-8191(92)90081-H
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

Theoretical Computer Science
Software
Hardware and Architecture
Computer Networks and Communications
Computer Graphics and Computer-Aided Design
Artificial Intelligence

Access to Document

10.1016/0167-8191(92)90081-H

Cite this

@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 = "Parallel algorithm, SIMD machines, convex hull, smallest enclosing rectangle",

author = "Jeong, \{Chang Sung\} and Choi, \{Jung Ju\} and Lee, \{Der Tsai\}",

note = "Funding Information: * Research supported by KOSEF",

year = "1992",

month = feb,

doi = "10.1016/0167-8191(92)90081-H",

language = "English",

volume = "18",

pages = "221--229",

journal = "Parallel Computing",

issn = "0167-8191",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Parallel enclosing rectangle on SIMD machines

AU - Jeong, Chang Sung

AU - Choi, Jung Ju

AU - Lee, Der Tsai

N1 - Funding Information: * Research supported by KOSEF

PY - 1992/2

Y1 - 1992/2

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 - Parallel algorithm

KW - SIMD machines

KW - convex hull

KW - smallest enclosing rectangle

UR - https://www.scopus.com/pages/publications/44049120292

U2 - 10.1016/0167-8191(92)90081-H

DO - 10.1016/0167-8191(92)90081-H

M3 - Article

AN - SCOPUS:44049120292

SN - 0167-8191

VL - 18

SP - 221

EP - 229

JO - Parallel Computing

JF - Parallel Computing

IS - 2

ER -

Parallel enclosing rectangle on SIMD machines

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this