一种求圆盘凸包的平行方法

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-04-19 DOI:10.1109/ICAPP.1995.472195

Wei Chen, K. Wada, K. Kawaguchi

{"title":"一种求圆盘凸包的平行方法","authors":"Wei Chen, K. Wada, K. Kawaguchi","doi":"10.1109/ICAPP.1995.472195","DOIUrl":null,"url":null,"abstract":"We present a parallel method for finding the convex hull of a set of discs in the CREW PRAM model. We show that the convex hull of n discs can be computed in O(log/sup 1+/spl epsiv// n) time using O(n/log/sup /spl epsiv// n) processors, where /spl epsiv/ is any positive constant. We also show that it can be constructed in O(log n loglog n) time using O(n log n) processors. The first result achieves cost optimal and the second one runs faster. The main technique which we used in the algorithm is a complex divide-and-conquer technique.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A parallel method for finding the convex hull of discs\",\"authors\":\"Wei Chen, K. Wada, K. Kawaguchi\",\"doi\":\"10.1109/ICAPP.1995.472195\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a parallel method for finding the convex hull of a set of discs in the CREW PRAM model. We show that the convex hull of n discs can be computed in O(log/sup 1+/spl epsiv// n) time using O(n/log/sup /spl epsiv// n) processors, where /spl epsiv/ is any positive constant. We also show that it can be constructed in O(log n loglog n) time using O(n log n) processors. The first result achieves cost optimal and the second one runs faster. The main technique which we used in the algorithm is a complex divide-and-conquer technique.<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了一种求解CREW PRAM模型中一组圆盘凸壳的并行方法。我们证明了n个圆盘的凸包可以用O(n/log/sup /spl epsiv// n)处理器在O(log/sup 1+/spl epsiv// n)时间内计算出来，其中/spl epsiv/是任意正常数。我们也证明了它可以用O(n log n)个处理器在O(log n log n)个时间内构造出来。第一个结果达到成本最优，第二个结果运行得更快。我们在算法中使用的主要技术是一种复杂的分治技术。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A parallel method for finding the convex hull of discs

We present a parallel method for finding the convex hull of a set of discs in the CREW PRAM model. We show that the convex hull of n discs can be computed in O(log/sup 1+/spl epsiv// n) time using O(n/log/sup /spl epsiv// n) processors, where /spl epsiv/ is any positive constant. We also show that it can be constructed in O(log n loglog n) time using O(n log n) processors. The first result achieves cost optimal and the second one runs faster. The main technique which we used in the algorithm is a complex divide-and-conquer technique.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing

自引率

0.00%

发文量