The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans cet article, nous présentons des algorithmes parallèles déterministes pour l'enveloppe convexe de points triés et leur application à un problème connexe. Les algorithmes sont proposés pour le modèle multi-ordinateur à grains grossiers (CGM). Nous proposons d'abord un algorithme parallèle optimal en termes de coût pour calculer le problème avec un nombre constant de cycles de communication pour n/p
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Naoki OSHIGE, Akihiro FUJIWARA, "Round Optimal Parallel Algorithms for the Convex Hull of Sorted Points" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1152-1160, May 2001, doi: .
Abstract: In this paper, we present deterministic parallel algorithms for the convex hull of sorted points and their application to a related problem. The algorithms are proposed for the coarse grained multicomputer (CGM) model. We first propose a cost optimal parallel algorithm for computing the problem with a constant number of communication rounds for n/p
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1152/_p
Copier
@ARTICLE{e84-a_5_1152,
author={Naoki OSHIGE, Akihiro FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Round Optimal Parallel Algorithms for the Convex Hull of Sorted Points},
year={2001},
volume={E84-A},
number={5},
pages={1152-1160},
abstract={In this paper, we present deterministic parallel algorithms for the convex hull of sorted points and their application to a related problem. The algorithms are proposed for the coarse grained multicomputer (CGM) model. We first propose a cost optimal parallel algorithm for computing the problem with a constant number of communication rounds for n/p
keywords={},
doi={},
ISSN={},
month={May},}
Copier
TY - JOUR
TI - Round Optimal Parallel Algorithms for the Convex Hull of Sorted Points
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1152
EP - 1160
AU - Naoki OSHIGE
AU - Akihiro FUJIWARA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - In this paper, we present deterministic parallel algorithms for the convex hull of sorted points and their application to a related problem. The algorithms are proposed for the coarse grained multicomputer (CGM) model. We first propose a cost optimal parallel algorithm for computing the problem with a constant number of communication rounds for n/p
ER -