AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
From MaRDI portal
Publication:4698354
DOI10.1142/S0218195995000076zbMATH Open0818.68084OpenAlexW2109461981MaRDI QIDQ4698354FDOQ4698354
Authors: 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
Recommendations
- An optimal parallel algorithm for the visibility of a simple polygon from a point
- An optimal algorithm for detecting weak visibility of a polygon
- scientific article; zbMATH DE number 4050998
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Parallel methods for visibility and shortest-path problems in simple polygons
- An optimal visibility graph algorithm for triangulated simple polygons
- scientific article; zbMATH DE number 3883623
- An addendum to parallel methods for visibility and shortest-path problems in simple polygons
Cited In (9)
- Parallel algorithm for segment visibility reporting
- Testing a simple polygon for monotonicity optimally in parallel
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- Parallel methods for visibility and shortest-path problems in simple polygons
- PARALLEL ALGORITHMS FOR COMPUTING THE CLOSEST VISIBLE VERTEX PAIR BETWEEN TWO POLYGONS
- Title not available (Why is that?)
- An optimal parallel algorithm for the visibility of a simple polygon from a point
- A space-time trade-off for computing the visibility polygon in the multi-pass model
- Title not available (Why is that?)
This page was built for publication: AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698354)
