scientific article; zbMATH DE number 4050998
From MaRDI portal
Publication:3787487
Recommendations
Cited in
(18)- Visibility between two edges of a simple polygon
- An optimal visibility graph algorithm for triangulated simple polygons
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Weak visibility counting in simple polygons
- Approximability of guarding weak visibility polygons
- Visibility of a simple polygon
- scientific article; zbMATH DE number 4043246 (Why is no real title available?)
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- scientific article; zbMATH DE number 1102588 (Why is no real title available?)
- Determining Weak Visibility of a Polygon from an Edge in Parallel
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
- An O(n n) algorithm for computing a link center in a simple polygon
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Three dimensional weak visibility: Complexity and applications
- An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
- An optimal algorithm for finding the edge visibility polygon under limited visibility
- Characterizing and recognizing weak visibility polygons
- Some chain visibility problems in a simple polygon
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787487)
