Optimal BSR solutions to several convex polygon problems

DOI10.1023/A:1013587415197MaRDI QIDQ5960443zbMATH OpenOpenAlexFDO

Authors Jean Frédéric Myoupo, David Semé, Ivan Stojmenović

Publication date 7 April 2002

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013587415197

zbMATH Keywords

broadcasting with selective reduction

Mathematics Subject Classification ID

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

Recommendations

• Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems
• Sequential and parallel algorithms for finding a maximum convex polygon
• scientific article; zbMATH DE number 2090610
• Convexity problems on meshes with multiple broadcasting
• Parallel algorithms for some functions of two convex polygons

Cited in

(2)

• Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems
• Collapsing the hierarchy of parallel computational models

This page was built for publication: Optimal BSR solutions to several convex polygon problems

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