scientific article; zbMATH DE number 1424292

MaRDI QIDQ4945504zbMATH OpenFDO

Authors Danny Z. Chen, Mikhail J. Atallah

Publication date 7 October 2001

zbMATH Keywords

networks of processorsparallel computational geometryshared-memory model

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Review text

The goal of this paper is to give a detailed look at the currently most successful techniques in parallel computational geometry, while simultaneously highlighting some open problems, and discussing possible extensions to these techniques. The paper gives a detailed coverage of the shared-memory model at the expense of the coverage of the networks of processors and focuses on general algorithmic techniques rather than on specific problems. For the entire collection see [Zbl 0930.65001].

Recommendations

• scientific article; zbMATH DE number 1182929
• Parallel computational geometry
• Publication:3028358
• scientific article; zbMATH DE number 4092772

Cited in

(8)

• Recursion and parallel algorithms in geometric modeling problems
• scientific article; zbMATH DE number 4016210 (Why is no real title available?)
• scientific article; zbMATH DE number 3980549 (Why is no real title available?)
• scientific article; zbMATH DE number 4092772 (Why is no real title available?)
• Parallel strategies for geometric probing
• scientific article; zbMATH DE number 1182929 (Why is no real title available?)
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
• Data parallel geometric operations on lists

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945504)