scientific article; zbMATH DE number 4050998

zbMATH Open0644.68068MaRDI QIDQ3787487FDOQ3787487

Jörg-Rüdiger Sack, Subhash Suri

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• 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

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)

Cited In (17)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Three dimensional weak visibility: Complexity and applications
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• Visibility of a simple polygon
• An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
• Visibility between two edges of a simple polygon
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• Some chain visibility problems in a simple polygon
• An O(n log n) algorithm for computing a link center in a simple polygon
• 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)