Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

DOI10.1006/JAGM.1996.0023MaRDI QIDQ4881404zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen

Publication date 9 June 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1949&context=cstech

zbMATH Keywords

CREW PRAM computational model

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Determining Weak Visibility of a Polygon from an Edge in Parallel
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

Cited in

(8)

• Determining Weak Visibility of a Polygon from an Edge in Parallel
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Efficient edge-skeleton computation for polytopes defined by oracles
• Guarding in a simple polygon
• Finding the shortest boundary guard of a simple polygon
• Open guard edges and edge guards in simple polygons
• LR-visibility in polygons

This page was built for publication: Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881404)