Parallel algorithm for farthest point delaunay triangulation

[Brad Barber]

At 05:08 PM 1/20/02, Mantena V Raju wrote:
>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.

Qhull computes the furthest point Delaunay triangulation (serial).
               http://www.geom.umn.edu/locate/qhull

Clarkson's hull program includes code for computing Alpha shapes
               http://netlib.bell-labs.com/netlib/voronoi/hull.html

                                                         --Brad



>         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.


-------------
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.