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

Chang-Sung Jeong, Jung Ju Choi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages138-141
Number of pages4
ISBN (Print)0818626720
Publication statusPublished - 1992 Dec 1
Externally publishedYes
EventProceedings of the 6th International Parallel Processing Symposium - Beverly Hills, CA, USA
Duration: 1992 Mar 231992 Mar 26

Other

OtherProceedings of the 6th International Parallel Processing Symposium
CityBeverly Hills, CA, USA
Period92/3/2392/3/26

Fingerprint

Parallel algorithms
Decomposition

ASJC Scopus subject areas

  • Hardware and Architecture

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). 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.

Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States : Publ by IEEE, 1992. p. 138-141.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Jeong, C-S & Choi, JJ 1992, Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer. in 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.
Jeong C-S, Choi JJ. Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer. In Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States: Publ by IEEE. 1992. p. 138-141
Jeong, Chang-Sung ; Choi, Jung Ju. / Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer. Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, United States : Publ by IEEE, 1992. pp. 138-141
@inproceedings{7eca117861cb47c282d170f60581290a,
title = "Optimal parallel algorithm for finding the smallest enclosing rectangle on a mesh-connected computer",
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.",
author = "Chang-Sung Jeong and Choi, {Jung Ju}",
year = "1992",
month = "12",
day = "1",
language = "English",
isbn = "0818626720",
pages = "138--141",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Publ by IEEE",

}

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 -