Developing a Practical Projection-Based Parallel Delaunay Algorithm (1996)(Make Corrections)(5 citations) Guy E. Blelloch, Gary L. Miller, Dafna Talmor
Abstract: In this paper we are concerned with developing a practical
parallel algorithm for Delaunay triangulation that works
well on general distributions, particularly those that arise
in Scientific Computation. Although there have been many
theoretical algorithms for the problem, and some implementations
based on bucketing that work well for uniform distributions,
there has been little work on implementations for
general distributions.
We use the well known reduction of 2D Delaunay triangulation
to 3D ... (Update)
.... several parallel machines [8] and has been used both for teaching parallel algorithms [9, 7] and implementing various applications [17, 4, 1]. The parallelism in the language is based on including a primitive sequence data type, a parallel map operation, and a small set of...
.... Talmor recently developed a CREW PRAM algorithm that does not rely on bucketing and hence can efficiently handle non uniform datasets [8]. It is divide and conquer in style but uses a marriage before conquest approach to eliminate the expensive merge step that has hindered...
G. Blelloch, G. L. Miller, and D. Talmor. Developing a practical projection-based parallel Delaunay algorithm. In Proceedings ACM Symposium on Computational Geometry, May 1996. http://citeseer.nj.nec.com/blelloch96developing.html More
@inproceedings{ blelloch96developing,
author = "G. E. Blelloch and G. L. Miller and D. Talmor",
title = "{Developing a Practical Projection-Based Parallel Delaunay Algorithm}",
booktitle = "12th Annual Symposium on Computational Geometry",
year = "1996",
url = "citeseer.nj.nec.com/blelloch96developing.html" }