Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin  Home/Search
Context Related
| rtm.science.unitn.it/...ferreira3.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rtm.science.unitn.it/...tutorials (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper 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-like models of computation, where p processors, with O( n p ) AE O(1) 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 O( n log n p ) local computation per step. Both... (Update)
Context of citations to this paper: More
.... has been used (explicitly or implicitly) in parallel algorithm design for various problems and shown very good practical timing results ([4, 10, 11]) Our work In this paper we propose a scalable coarse grained randomized algorithm for computing the MIS of a general graph, in...
Cited by: More
A Randomized BSP/CGM Algorithm for the Maximal Independent Set.. - Schabanel (Correct)
Active bibliography (related documents): More All
0.6: Parallel Computation on Interval Graphs: Algorithms .. - Ferreira, Lassous, .. (2000) (Correct)
0.6: Parallel Computation on Interval Graphs using PC Clusters.. - Rau-Chaplin (1998) (Correct)
0.5: Efficient Parallel Algorithms for Closest Point Problems - Peter Su (1994) (Correct)
Similar documents based on text: More All
0.3: d-Dimensional Range Search on Multicomputers - Ferreira, Kenyon, Rau-Chaplin, .. (1996) (Correct)
0.3: A Case-Based Reasoning System Involving A Quantized.. - Kuchar, Lazukova.. (Correct)
0.2: An Optimization Model for Routing in Low Earth.. - Ferreira.. (Correct)
BibTeX entry: (Update)
M. Diallo, A. Ferreira, and A. Rau-Chaplin. Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram. In 15th Symp. on Theoretical Aspects of Computer Science (STACS), LNCS. Springer Verlag, February 1998. http://citeseer.ist.psu.edu/diallo98communicationefficient.html More
@inproceedings{ diallo98communicationefficient,
author = "Mohamadou Diallo and Afonso Ferreira and Andrew Rau-Chaplin",
title = "Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram",
booktitle = "Symposium on Theoretical Aspects of Computer Science",
pages = "399-409",
year = "1998",
url = "citeseer.ist.psu.edu/diallo98communicationefficient.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
531 LogP: Towards a realistic model of parallel computation - Culler, Karp et al. - 1993
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
109 Scalable parallel geometric algorithms for coarse grained mu.. - Dehne, Fabri et al. - 1993
53 Parallel Computational Geometry (context) - Akl, Lyons - 1993
45 convex hull algorithm for coarse grained multicomputers (context) - Dehne, Deng et al. - 1995
45 Location of a point in a planar subdivision and its applicat.. (context) - Lee, Preparata - 1977
27 This article was processed using the L A T E X macro package.. (context) - Valiant, model et al. - 1990
17 the parallel-decomposability of geometric problems (context) - Atallah, Tsay - 1989
9 convex hull and triangulation for coarse grained multicomput.. (context) - Ferreira, Rau-Chaplin et al. - 1995
6 An improved parallel algorithm for constructing vorono# diag.. (context) - Jeong - 1991
4 Good algorithm design style for multiprocessors (context) - Deng, Gu - 1994
4 Scalable and archtecture independent parallel geometric algo.. (context) - Dehne, Fabri et al. - 1994
2 Computational geometry on a hypercube (context) - Stojmenovic - 1987
1 Merging free trees in parallel for eOEcient vorono# diagram .. (context) - Cole, Goodrich et al. - 1990
1 Communication-eOEcient parallel sorting (context) - Goodrich - 1996
Documents on the same site (http://rtm.science.unitn.it/alex98/tutorials.html): More
The Obnoxious Center Problem on a Tree - Burkard, Lin, Rote (1998) (Correct)
Packet Scheduling in Single-Hop Communication Systems - Bonuccelli (Correct)
Models For Parallel Algorithm Design: An Introduction - Ferreira, Morvan (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC