7

Porting a vector library: a comparison of
– Jonathan C Hardwick
 1994

5

Dafna Talmor. Developing a practical projectionbased parallel Delaunay algorithm
– Guy E Blelloch, Gary L Miller
 1996

4

Dynamic and recursive parallel algorithms for constructing Delaunay triangulations
– Yuemin Ding, Paul J Densham
 1994

9

The DivideandConquer Paradigm as a Basis for Parallel Language Design
– Tom Axford
 1992

3

Srinivas Aluru, and Sanjay Ranka. Concatenated parallelism: Atechnique for e cient parallel divide and conquer
– Sanjay Goil
 1996

4

An optimal mesh computer algorithm for constrained Delaunay triangulation
– Sumanta Guha
 1994

2

Triangulation, Voronoi diagram, and convex hull in kspace on meshconnected arrays and hypercubes
– J Andrew Holey, Oscar H Ibarra
 1991

7

A note on improving the performance of Delaunay triangulation
– J R Davy, P M Dew
 1989

4

Algorithm 63 (partition) and algorithm 65 ( nd
– C A R Hoare
 1961

9

E cient parallel implementation of an algorithm for Delaunay triangulation
– M Merriam
 1993

10

Efficient parallel algorithms for closest point problems
– Peter Su
 1994

13

Leewen. Maintenance of con gurations in the plane
– M H Overmars, J van
 1981

5

Dynamic load balancing in a 2D parallel Delaunay mesh generator
– N A Verhoeven, N P Weatherill, K Morgan
 1995

22

Algorithm 63 (PARTITION) and algorithm 65 (FIND
– C A R Hoare
 1961

3

Dunlaing C. Merging free trees in parallel for efficient Voronoi diagram construction
– R Cole, M Goodrich
 1989

16

A dataparallel algorithm for the threedimensional Delaunay triangulation and its implementation
– Y A Teng, F Sullivan, I Beichl, E Puppo
 1993

53

Transforming HighLevel DataParallel Programs into Vector Operations
– Jan F. Prins, Daniel W. Palmer
 1993

52

A faster divideandconquer algorithm for constructing Delaunay triangulations, Algorithmica 2
– R A Dwyer
 1987

33

Outputsensitive construction of polytopes in four dimensions T.M. Chan and clipped Voronoi diagrams in three
– T M Chan, J Snoeyink, CK Yap
