### 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^{2} n) respectively.

Original language | English |
---|---|

Pages (from-to) | 221-229 |

Number of pages | 9 |

Journal | Parallel Computing |

Volume | 18 |

Issue number | 2 |

Publication status | Published - 1992 Feb 1 |

Externally published | Yes |

### Fingerprint

### 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

*Parallel Computing*,

*18*(2), 221-229.

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

Research output: Contribution to journal › Article

*Parallel Computing*, vol. 18, no. 2, pp. 221-229.

}

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 -