AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON

DOI10.1142/S0218195995000076zbMath0818.68084OpenAlexW2109461981MaRDI QIDQ4698354

Danny Z. Chen

Publication date: 17 May 1995

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195995000076

zbMATH Keywords

weak visibilityoptimal parallel algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

This page was built for publication: AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON