Parallel algorithm for farthest point delaunay triangulation

[Mantena V Raju]

Hi,
	I am working on parallelizing alpha shapes in 2 and 3
dimensions. I was searching for serial and parallel algorithms for
constructing the farthest point delaunay traingulation which is a part of
constructing the alpha shapes in 2 dimensions.

	I need helping in finding an algorithm for farthest point delaunay
triangulation.

Thanks in advance
Mantena V. Raju


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.