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
본 논문에서는 정렬된 점의 볼록 껍질에 대한 결정론적 병렬 알고리즘과 관련 문제에 대한 적용을 제시합니다. 알고리즘은 CGM(Coarse Grained Multicomputer) 모델에 대해 제안되었습니다. 우리는 먼저 일정한 수의 통신 라운드로 문제를 계산하기 위한 비용 최적 병렬 알고리즘을 제안합니다. 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.
부
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
부
@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},}
부
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 -