### Abstract

In this paper, we consider the problem of finding the smallest triangle circumscribing a convex polygon with n edges. We shall show that this can be done in O(√n) time by the efficient data partition schemes and the proper set mapping and comparison operations using what so called √n-decomposition technique. Since the nontrivial operation on MCC requires Ω(√n), the time complexity is optimal within constant time factor.

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

Title of host publication | Proceedings of the International Conference on Parallel Processing |

Place of Publication | Piscataway, NJ, United States |

Publisher | Publ by IEEE |

Pages | 138-141 |

Number of pages | 4 |

ISBN (Print) | 0818626720 |

Publication status | Published - 1992 Dec 1 |

Externally published | Yes |

Event | Proceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA Duration: 1992 Mar 23 → 1992 Mar 26 |

### Other

Other | Proceedings of the 6th International Parallel Processing Symposium |
---|---|

City | Beverly Hills, CA, USA |

Period | 92/3/23 → 92/3/26 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Proceedings of the International Conference on Parallel Processing*(pp. 138-141). Piscataway, NJ, United States: Publ by IEEE.

**Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer.** / Jeong, Chang-Sung; Choi, Jung Ju.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the International Conference on Parallel Processing.*Publ by IEEE, Piscataway, NJ, United States, pp. 138-141, Proceedings of the 6th International Parallel Processing Symposium, Beverly Hills, CA, USA, 92/3/23.

}

TY - GEN

T1 - Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer

AU - Jeong, Chang-Sung

AU - Choi, Jung Ju

PY - 1992/12/1

Y1 - 1992/12/1

N2 - In this paper, we consider the problem of finding the smallest triangle circumscribing a convex polygon with n edges. We shall show that this can be done in O(√n) time by the efficient data partition schemes and the proper set mapping and comparison operations using what so called √n-decomposition technique. Since the nontrivial operation on MCC requires Ω(√n), the time complexity is optimal within constant time factor.

AB - In this paper, we consider the problem of finding the smallest triangle circumscribing a convex polygon with n edges. We shall show that this can be done in O(√n) time by the efficient data partition schemes and the proper set mapping and comparison operations using what so called √n-decomposition technique. Since the nontrivial operation on MCC requires Ω(√n), the time complexity is optimal within constant time factor.

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

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

M3 - Conference contribution

AN - SCOPUS:0026986335

SN - 0818626720

SP - 138

EP - 141

BT - Proceedings of the International Conference on Parallel Processing

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -