{"title":"几何问题的高效bsr并行算法","authors":"D. Semé, J. Myoupo","doi":"10.1109/EMPDP.2001.905052","DOIUrl":null,"url":null,"abstract":"This paper presents BSR-parallel algorithms for three geometrical problems: point location, convex hull and smallest enclosing rectangle. These problems are solved in constant time using the BSR model introduced by Akl and Guenther in 1989. The first algorithm uses O(N) processors (N is the number of edges of the polygon R). The second uses O(N'/sup 2/) processors (N' is the number of points) and the third one uses O(N'/sup 2/) processors (it need the convex hull) to solve the smallest enclosing rectangle problem. These new results suggest that many other geometrical problems can be solved in constant time using the BSR model.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient BSR-based parallel algorithms for geometrical problems\",\"authors\":\"D. Semé, J. Myoupo\",\"doi\":\"10.1109/EMPDP.2001.905052\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents BSR-parallel algorithms for three geometrical problems: point location, convex hull and smallest enclosing rectangle. These problems are solved in constant time using the BSR model introduced by Akl and Guenther in 1989. The first algorithm uses O(N) processors (N is the number of edges of the polygon R). The second uses O(N'/sup 2/) processors (N' is the number of points) and the third one uses O(N'/sup 2/) processors (it need the convex hull) to solve the smallest enclosing rectangle problem. These new results suggest that many other geometrical problems can be solved in constant time using the BSR model.\",\"PeriodicalId\":262971,\"journal\":{\"name\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMPDP.2001.905052\",\"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 Ninth Euromicro Workshop on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2001.905052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient BSR-based parallel algorithms for geometrical problems
This paper presents BSR-parallel algorithms for three geometrical problems: point location, convex hull and smallest enclosing rectangle. These problems are solved in constant time using the BSR model introduced by Akl and Guenther in 1989. The first algorithm uses O(N) processors (N is the number of edges of the polygon R). The second uses O(N'/sup 2/) processors (N' is the number of points) and the third one uses O(N'/sup 2/) processors (it need the convex hull) to solve the smallest enclosing rectangle problem. These new results suggest that many other geometrical problems can be solved in constant time using the BSR model.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
