平面点定位与二维Voronoï图的通信高效确定性并行算法研究

IF 0.5 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Parallel Processing Letters Pub Date : 1998-02-25 DOI:10.1142/S0129626401000622

Mohamadou A. Diallo, Afonso Ferreira, A. Rau-Chaplin

{"title":"平面点定位与二维Voronoï图的通信高效确定性并行算法研究","authors":"Mohamadou A. Diallo, Afonso Ferreira, A. Rau-Chaplin","doi":"10.1142/S0129626401000622","DOIUrl":null,"url":null,"abstract":"In this note we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP/CGM-like models of computation, where p processors, with local memory each, communicate through some arbitrary interconnection network. They are communication-efficient since they require, respectively, O(1) and O(log p) communication steps and local computation per step. Both algorithms require local memory.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"855 1","pages":"399-409"},"PeriodicalIF":0.5000,"publicationDate":"1998-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram\",\"authors\":\"Mohamadou A. Diallo, Afonso Ferreira, A. Rau-Chaplin\",\"doi\":\"10.1142/S0129626401000622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this note we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP/CGM-like models of computation, where p processors, with local memory each, communicate through some arbitrary interconnection network. They are communication-efficient since they require, respectively, O(1) and O(log p) communication steps and local computation per step. Both algorithms require local memory.\",\"PeriodicalId\":44742,\"journal\":{\"name\":\"Parallel Processing Letters\",\"volume\":\"855 1\",\"pages\":\"399-409\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"1998-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Processing Letters\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0129626401000622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Processing Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0129626401000622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 7

摘要

在本文中，我们描述了平面点定位和n个共面点的Voronoi图的构建的确定性并行算法。这些算法是为类似BSP/ cgm的计算模型设计的，其中p个处理器，每个都有本地内存，通过一些任意互连网络进行通信。它们具有通信效率，因为它们分别需要O(1)和O(log p)个通信步骤和每一步的本地计算。这两种算法都需要本地内存。

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

查看原文本刊更多论文

A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram

In this note we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP/CGM-like models of computation, where p processors, with local memory each, communicate through some arbitrary interconnection network. They are communication-efficient since they require, respectively, O(1) and O(log p) communication steps and local computation per step. Both algorithms require local memory.

求助全文

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

来源期刊

Parallel Processing Letters COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-

CiteScore

0.90

自引率

25.00%

发文量

期刊介绍： Parallel Processing Letters (PPL) aims to rapidly disseminate results on a worldwide basis in the field of parallel processing in the form of short papers. It fills the need for an information vehicle which can convey recent achievements and further the exchange of scientific information in the field. This journal has a wide scope and topics covered included: - design and analysis of parallel and distributed algorithms - theory of parallel computation - parallel programming languages - parallel programming environments - parallel architectures and VLSI circuits