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

### ASJC Scopus subject areas

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer'. Together they form a unique fingerprint.

## Cite this

Jeong, C-S., & Choi, J. J. (1992). Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer. In

*Proceedings of the International Conference on Parallel Processing*(pp. 138-141). Publ by IEEE.