Finding coarse grained parallelism in computational geometry algorithms

DOI10.1007/3-540-44842-X_93MaRDI QIDQ3082969zbMATH OpenOpenAlexFDO

Authors Volodymyr Beletskyy

Publication date 18 March 2011

Published in Computational Science and Its Applications — ICCSA 2003 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44842-x_93

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1222819
• Finding Synchronization-Free Parallelism for Non-uniform Loops
• scientific article; zbMATH DE number 2090596
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers

Cited in

(3)

• LOOK: A lazy object-oriented kernel design for geometric computation
• Finding Synchronization-Free Parallelism for Non-uniform Loops
• Parallel strategies for geometric probing

This page was built for publication: Finding coarse grained parallelism in computational geometry algorithms

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