Xref: utzoo comp.theory:1234 comp.parallel:1907
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!emory!hubcap!waldi
From: waldi@uni-paderborn.de (Waldemar Preilowski)
Newsgroups: comp.theory,comp.parallel
Subject: Parallel Algo's for Triangulation
Message-ID: <11718@hubcap.clemson.edu>
Date: 19 Nov 90 14:59:50 GMT
References: <40171@shemp.CS.UCLA.EDU>
Sender: fpst@hubcap.clemson.edu
Organization: Uni-GH Paderborn, West Germany
Lines: 22
Approved: parallel@hubcap.clemson.edu

Hello,

does somebody know any parallel algorithms for triangulation of
general point sets in 3-dim space. To the best of my knowledge,
El Ghindy's algorithm finds a triangulation of a simplificial
point set in time O( (log n)^2 ) with O(n) processors
[1987, Journal of Parallel Programming]. 

Are there any other references ?

Please answer by e-mail. I'll summarize.

Kind regards,

	Waldemar Preilowski
--------------------------------------------------------------------------
 Waldemar Preilowski                  | e-mail: waldi@uni-paderborn.de 
 Universitaet-GH Paderborn            | or:     waldi@pbinfo.uucp
 Fachbereich 17-Mathematik/Informatik | or:   ...!uunet!unido!pbinfo!waldi
 Warburger Str. 100                   | FAX:   +49 5251 602519
 D-W-4790 Paderborn, Germany          | Phone: +49 5251 603326
--------------------------------------------------------------------------