scientific article; zbMATH DE number 4050998

MaRDI QIDQ3787487zbMATH OpenFDO

Authors Jörg-Rüdiger Sack, Subhash Suri

Publication date 1988

zbMATH Keywords

computational geometrylinear-time algorithmweak visibility of polygon

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04)

Recommendations

• scientific article; zbMATH DE number 4043246
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• Visibility between two edges of a simple polygon
• Visibility of a simple polygon

Cited in

(17)

• scientific article; zbMATH DE number 1102588 (Why is no real title available?)
• scientific article; zbMATH DE number 4043246 (Why is no real title available?)
• An \(O(n \log n)\) algorithm for computing a link center in a simple polygon
• Determining Weak Visibility of a Polygon from an Edge in Parallel
• A constant-factor approximation algorithm for vertex guarding a WV-polygon
• Approximability of guarding weak visibility polygons
• Weak visibility counting in simple polygons
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• Three dimensional weak visibility: Complexity and applications
• Visibility of a simple polygon
• An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
• Visibility between two edges of a simple polygon
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
• Some chain visibility problems in a simple polygon
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• An optimal visibility graph algorithm for triangulated simple polygons
• Characterizing and recognizing weak visibility polygons

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)