Optimal parallel hypercube algorithms for polygon problems

DOI10.1109/12.392849MaRDI QIDQ4421237zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Mikhail J. Atallah

Publication date 1995

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/1045

zbMATH Keywords

convex hullsvisibility

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Efficient parallel convex hull algorithms
• scientific article; zbMATH DE number 4050997
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• scientific article; zbMATH DE number 1256697
• Parallel fractional cascading on hypercube multiprocessors

Cited in

(9)

• Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• Parallel fractional cascading on hypercube multiprocessors
• Edge intersection on the hypercube computer
• Efficient parallel algorithm for quasi pentadiagonal systems on a hypercube
• scientific article; zbMATH DE number 4050997 (Why is no real title available?)
• Fibonacci hypercube
• scientific article; zbMATH DE number 140494 (Why is no real title available?)
• scientific article; zbMATH DE number 219274 (Why is no real title available?)

This page was built for publication: Optimal parallel hypercube algorithms for polygon problems

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