waldi@uni-paderborn.de (Waldemar Preilowski) (11/19/90)
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 --------------------------------------------------------------------------