Name
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(square-root n) and O(log2 n) respectively. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0167-8191(92)90081-H | PARALLEL COMPUTING |
Keywords | Field | DocType |
PARALLEL ALGORITHM,SMALLEST ENCLOSING RECTANGLE,CONVEX HULL,SIMD MACHINES | Parallel algorithm,Computer science,Computational geometry,Largest empty rectangle,Rectangle,Parallel computing,Convex hull,SIMD,Theoretical computer science,Time complexity,Hypercube | Journal |
Volume | Issue | ISSN |
18 | 2 | 0167-8191 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chang-Sung Jeong | 1 | 172 | 35.88 |
| Jung-ju Choi | 2 | 24 | 5.10 |
| D.T. Lee | 3 | 627 | 78.14 |